Travelled to:1 × Canada
1 × Greece
6 × USA
Collaborated with:∅ S.Vempala W.Perkins A.Zaks N.Aizikowitz A.De I.Diakonikolas R.A.Servedio M.Ajtai A.Hassidim J.Nelson S.Roy L.Chiticariu F.Reiss H.Zhu E.Grigorescu L.Reyzin Y.Xiao C.Dwork M.Hardt T.Pitassi O.Reingold A.L.Roth
Talks about:algorithm (2) approxim (2) statist (2) problem (2) solut (2) plant (2) learn (2) membership (1) dictionari (1) comparison (1)
Person: Vitaly Feldman
DBLP: Feldman:Vitaly
Contributed to:
2015
201320132012
200920082006
2000Wrote 9 papers:
- STOC-2015-DworkFHPRR #adaptation #data analysis #statistics
- Preserving Statistical Validity in Adaptive Data Analysis (CD, VF, MH, TP, OR, ALR), pp. 117–126.
- STOC-2015-FeldmanPV #complexity #on the #problem #random #satisfiability
- On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
- SIGMOD-2013-RoyCFRZ #information management #refinement #taxonomy
- Provenance-based dictionary refinement in information extraction (SR, LC, VF, FR, HZ), pp. 457–468.
- STOC-2013-FeldmanGRVX #algorithm #bound #clique #detection #statistics
- Statistical algorithms and a lower bound for detecting planted cliques (VF, EG, LR, SV, YX), pp. 655–664.
- STOC-2012-DeDFS #approximate #parametricity #problem
- Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces (AD, ID, VF, RAS), pp. 729–746.
- ICALP-v1-2009-AjtaiFHN #sorting
- Sorting and Selection with Imprecise Comparisons (MA, VF, AH, JN), pp. 37–48.
- STOC-2008-Feldman #algorithm #learning
- Evolvability from learning algorithms (VF), pp. 619–628.
- STOC-2006-Feldman #approximate #learning #logic #query
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.
- OOPSLA-2000-ZaksFA #java
- Sealed calls in Java packages (AZ, VF, NA), pp. 83–92.