Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Feldman, Vitaly"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces
Anindya De
,
Ilias Diakonikolas
,
Vitaly Feldman
,
Rocco A. Servedio
Journal of the ACM
61
(2), 2014, pp. 11: 1-36
Statistical algorithms and a lower bound for detecting planted cliques
Vitaly Feldman
,
Elena Grigorescu
,
Lev Reyzin
,
Santosh Vempala
,
Ying Xiao
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 655-664
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces
Anindya De
,
Ilias Diakonikolas
,
Vitaly Feldman
,
Rocco A. Servedio
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 729-746
Agnostic learning of monomials by halfspaces is hard
Vitaly Feldman
,
Venkatesan Guruswami
,
Prasad Raghavendra
,
Yi Wu
SIAM Journal on Computing
41
(6), 2012, pp. 1558-1590
A complete characterization of statistical query learning with applications to evolvability
Vitaly Feldman
Journal of Computer and System Sciences
78
(5), 2012, pp. 1444-1459
Sorting and selection with imprecise comparisons
Miklós Ajtai
,
Vitaly Feldman
,
Avinatan Hassidim
,
Jelani Nelson
Lecture Notes in Computer Science
5555
, 2009, pp. 37-48
On agnostic learning of parities, monomials, and halfspaces
Vitaly Feldman
,
Parikshit Gopalan
,
Subhash Khot
,
Ashok Kumar Ponnuswami
SIAM Journal on Computing
39
(2), 2009, pp. 606-645
Separating models of learning with faulty teachers
Vitaly Feldman
,
Shrenik Shah
Theoretical Computer Science
410
(19), 2009, pp. 1903-1912
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Vitaly Feldman
Journal of Computer and System Sciences
75
(1), 2009, pp. 13-26
The complexity of properly learning simple concept classes
Misha Alekhnovich
,
Mark Braverman
,
Vitaly Feldman
,
Adam R. Klivans
,
Toniann Pitassi
Journal of Computer and System Sciences
74
(1), 2008, pp. 16-34
Evolvability from learning algorithms
Vitaly Feldman
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 619-628
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Vitaly Feldman
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 363-372