631 search results - page 124 / 127 » Additive Approximation for Edge-Deletion Problems |
CN
2008
15 years 2 min ago
2008
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
115
click to vote
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
111
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
AI
2006
Springer
14 years 12 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...