SODA
1993
ACM
14 years 28 days ago
1993
ACM
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...
SODA
1993
ACM
14 years 28 days ago
1993
ACM
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 ...
SODA
1993
ACM
14 years 28 days ago
1993
ACM
SODA
1993
ACM
14 years 28 days ago
1993
ACM
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...
NIPS
1993
14 years 28 days ago
1993
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...
SODA
1997
ACM
14 years 29 days ago
1997
ACM
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...
SODA
1997
ACM
14 years 29 days ago
1997
ACM
SODA
1997
ACM
14 years 29 days ago
1997
ACM
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...
SODA
1997
ACM
14 years 29 days ago
1997
ACM
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...
SODA
1997
ACM
14 years 29 days ago
1997
ACM
