Sciweavers

SODA
1993
ACM
94views Algorithms» more  SODA 1993»
13 years 11 months ago
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
Alan M. Frieze, A. J. Radcliffe, Stephen Suen
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
SODA
1993
ACM
81views Algorithms» more  SODA 1993»
13 years 11 months ago
Lower Bounds for Set Intersection Queries
Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christ...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 11 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
NIPS
1993
13 years 11 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
13 years 11 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
SODA
1997
ACM
171views Algorithms» more  SODA 1997»
13 years 11 months ago
A Practical Approximation Algorithm for the LMS Line Estimator
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
David M. Mount, Nathan S. Netanyahu, Kathleen Roma...
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
13 years 11 months ago
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes
A hierarchical gradient of an unstructured mesh M0 is a sequence of meshes M1;...;Mk such that jMkj is smaller than a given threshold mesh size b. The gradient is well-conditioned...
Gary L. Miller, Dafna Talmor, Shang-Hua Teng
SODA
1997
ACM
113views Algorithms» more  SODA 1997»
13 years 11 months ago
The Influence of Caches on the Performance of Sorting
Anthony LaMarca, Richard E. Ladner