1091 search results - page 67 / 219 » Approximation Algorithms for Data Placement Problems |
NIPS
1994
13 years 9 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
CPM
1999
Springer
14 years 2 days ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
IJRR
2007
13 years 7 months ago
2007
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...