1051 search results - page 126 / 211 » On the Correspondence between Approximations and Similarity |
173
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
165
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
186
click to vote
MSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
178
click to vote
AIPS
2008
15 years 8 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
165
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...