Kane, Daniel
71  Ergebnisse:
Personensuche X
?
1

Outlier-Robust Clustering of Gaussians and Other Non-Spheri..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
 
?
2

Point Location and Active Learning: Learning Halfspaces Alm..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Hopkins, Max ; Kane, Daniel ; Lovett, Shachar. - p. 1034-1044 , 2020
 
?
3

High-Sensitivity Coherent Raman Spectroscopy with Doppler R..:

, In: 2019 Conference on Lasers and Electro-Optics (CLEO),
 
?
4

A PRG for boolean PTF of degree 2 with seed length subpolyn..:

, In: Proceedings of the 33rd Computational Complexity Conference,
Kane, Daniel ; Rao, Sankeerth - p. 1-24 , 2018
 
?
5

Mass-surveillance without the State : Strongly Undetecta..:

, In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security,
Bellare, Mihir ; Jaeger, Joseph ; Kane, Daniel - p. 1431-1440 , 2015
 
?
6

The geometry of binary search trees:

, In: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms,
Demaine, Erik D. ; Harmon, Dion ; Iacono, John.. - p. 496-505 , 2009
 
?
7

Wireless communication and its application in the healthcar..:

, In: 2006 The 4th Institution of Engineering and Technology Seminar on Appropriate Healthcare Technologies for Developing Countries,
Grainger, Peter ; Kane, Daniel ; Bowles, David... - p. 97-104 , 2006
 
?
8

Super Non-singular Decompositions of Polynomials and Their ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
 
?
9

Locality Bounds for Sampling Hamming Slices:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Kane, Daniel M. ; Ostuni, Anthony ; Wu, Kewen - p. 1279-1286 , 2024
 
?
10

Testing Closeness of Multivariate Distributions via Ramsey ..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
 
?
11

A Strongly Polynomial Algorithm for Approximate Forster Tra..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
 
?
12

Clustering mixture models in almost-linear time via list-de..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
13

Robustly learning mixtures of k arbitrary Gaussians:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bakshi, Ainesh ; Diakonikolas, Ilias ; Jia, He... - p. 1234-1247 , 2022
 
?
14

Learning general halfspaces with general Massart noise unde..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
15

Robust learning of mixtures of gaussians:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Kane, Daniel M. - p. 1246-1258 , 2021
 
1-15