Kenneth L. Clarkson
Kenneth L. Clarkson
IBM Almaden Research
Verifierad e-postadress på us.ibm.com - Startsida
TitelCiteras avÅr
Applications of random sampling in computational geometry, II
KL Clarkson, PW Shor
Discrete & Computational Geometry 4 (5), 387-421, 1989
12191989
Low-rank approximation and regression in input sparsity time
KL Clarkson, DP Woodruff
Journal of the ACM (JACM) 63 (6), 1-45, 2017
4222017
Combinatorial complexity bounds for arrangements of curves and spheres
KL Clarkson, H Edelsbrunner, LJ Guibas, M Sharir, E Welzl
Discrete & Computational Geometry 5 (2), 99-160, 1990
4011990
New applications of random sampling in computational geometry
KL Clarkson
Discrete & Computational Geometry 2 (2), 195-222, 1987
3991987
Las Vegas algorithms for linear and integer programming when the dimension is small
KL Clarkson
Journal of the ACM (JACM) 42 (2), 488-499, 1995
345*1995
A randomized algorithm for closest-point queries
KL Clarkson
SIAM Journal on Computing 17 (4), 830-847, 1988
344*1988
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
KL Clarkson
ACM Transactions on Algorithms (TALG) 6 (4), 1-30, 2010
3262010
Approximation algorithms for shortest path motion planning
K Clarkson
Proceedings of the nineteenth annual ACM symposium on Theory of computing, 56-65, 1987
2791987
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2651993
Nearest-neighbor searching and metric space dimensions
KL Clarkson
Nearest-neighbor methods for learning and vision: theory and practice, 15-59, 2006
2642006
Numerical linear algebra in the streaming model
KL Clarkson, DP Woodruff
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2622009
Nearest neighbor queries in metric spaces
KL Clarkson
Discrete & Computational Geometry 22 (1), 63-93, 1999
2561999
Improved approximation algorithms for geometric set cover
KL Clarkson, K Varadarajan
Discrete & Computational Geometry 37 (1), 43-58, 2007
2322007
Optimal core-sets for balls
M Bădoiu, KL Clarkson
Computational Geometry 40 (1), 14-22, 2008
2162008
Fast algorithms for the all nearest neighbors problem
KL Clarkson
24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 226-232, 1983
1851983
Smaller core-sets for balls
M Badoiu, KL Clarkson
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003
1762003
An algorithm for approximate closest-point queries
KL Clarkson
Proceedings of the tenth annual symposium on Computational geometry, 160-164, 1994
1631994
Safe and effective determinant evaluation
KL Clarkson
FOCS 92, 387-395, 1992
1631992
Fast linear expected-time algorithms for computing maxima and convex hulls
JL Bentley, KL Clarkson, DB Levine
Algorithmica 9 (2), 168-183, 1993
1611993
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
K Clarkson, S Kapoor, P Vaidya
Proceedings of the third annual symposium on Computational geometry, 251-257, 1987
1581987
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20