Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Clarkson, Kenneth L. - Computing Sciences Research Center, Bell Laboratories
A Randomized Algorithm for Closest-Point Kenneth L. Clarkson y
Building Triangulations Using #Nets Kenneth L. Clarkson #
A Model of Soft Handoff under Dynamic Shadow Kenneth L. Clarkson
Nearest Neighbor Queries in Metric Spaces Kenneth L. Clarkson
Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits
here come my slides!!!! Concluding Remarks
Las Vegas Algorithms for Linear and Integer Programming
Improved Approximation Algorithms for Geometric Set Kenneth L. Clarkson Kasturi Varadarajan y
Applications of Random Sampling in Computational Geometry, II
Approximating Center Points with Iterated Radon Points K. L. Clarkson y David Eppstein z Gary L. Miller x Carl Sturtivant {
A Bound on Local Minima of Arrangements that implies the Upper Bound Theorem
Subgradient and Sampling Algorithms for 1 Regression Kenneth L. Clarkson
Safe and E ective Determinant Evaluation Kenneth L. Clarkson
[26] K. L. Clarkson. A bound on local minima of arrangements that implies the upper bound theorem. Discrete and Computational Geometry, 10:427--233, 1993.
A General Randomized Incremental Reconstruction Procedure
Algorithms for the Minimum Diameter of Moving Points and for the Discrete 1-center Problem
Nearest-Neighbor Searching and Metric Space Kenneth L. Clarkson
RANDOMIZED GEOMETRIC ALGORITHMS KENNETH L. CLARKSON
Randomized Parallel Algorithms for Trapezoidal Kenneth L. Clarkson
Applications of Random Sampling in Computational Geometry, II
Approximation Algorithms for Planar Traveling Salesman Tours
More Output-Sensitive Geometric Algorithms extended abstract
Solution of Linear Systems Using Randomized Kenneth L. Clarkson
Abstract --3G wireless systems such as 3G-1X, 1xEV-DO and 1xEV-DV provide support for a variety of high-speed data applications. The success of these services critically relies on the capability to ensure an adequate QoS experience to users
Approximation Algorithms for Shortest Path Motion Planning extended abstract
Rectilinear shortest paths through polygonal obstacles O(n ( log n) 3/2 ) time
Approximation Algorithms for Shortest Path Motion Planning extended abstract
Safe and Effective Determinant Evaluation Kenneth L. Clarkson
Las Vegas Algorithms for Linear and Integer Programming
Nearest Neighbor Searching in Metric Spaces: Experimental Results for sb(S)
A General Randomized Incremental Reconstruction Procedure
A Bound on Local Minima of Arrangements that implies the Upper Bound Theorem
Subgradient and Sampling Algorithms for # 1 Regression Kenneth L. Clarkson #
Algorithms for Polytope Covering and Approximation, and for Approximate
New Applications of Random Sampling in Computational Geometry Kenneth L. Clarkson
On the Expected Number of k-sets of Coordinate-Wise Independent Points
Four Results on Randomized Incremental Constructions
Optimal Core-Sets for Balls Mihai Badoiu
Nearest-Neighbor Searching and Metric Space Kenneth L. Clarkson
A Model of Coverage Probability under Shadow Kenneth L. Clarkson John D. Hobby
Nearest Neighbor Queries in Metric Spaces Kenneth L. Clarkson
New Applications of Random Sampling in Computational Geometry Kenneth L. Clarkson
COLOR LAYER A Las Vegas Algorithm