Ofer Zeitouni

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sanjeev R. Kulkarni

> Home > Persons > Ofer Zeitouni

Publications

1994
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/DudleyKRZ94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/DudleyKRZ94
Richard M. Dudley, Sanjeev R. Kulkarni, T. J. Richardson, Ofer Zeitouni:
A metric entropy bound is not sufficient for learnability. IEEE Trans. Inf. Theory 40(3): 883-885 (1994)
1993
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/KulkarniMTZ93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/KulkarniMTZ93
Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis, Ofer Zeitouni:
PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 933-942 (1993)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/colt/KulkarniZ93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/KulkarniZ93
Sanjeev R. Kulkarni, Ofer Zeitouni:
On Probably Correct Classification of Concepts. COLT 1993: 111-116
1992
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/colt/KulkarniTMZ92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/KulkarniTMZ92
Sanjeev R. Kulkarni, John N. Tsitsiklis, Sanjoy K. Mitter, Ofer Zeitouni:
PAC Learning With Generalized Samples and an Application to Stochastic Geometry. COLT 1992: 172-179

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.