253 search results - page 47 / 51 » Faster Approximation of Distances in Graphs |
APPROX
2011
Springer
12 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
ALMOB
2006
13 years 6 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
PERCOM
2008
ACM
14 years 6 months ago
2008
ACM
Abstract--Analytical models to evaluate and predict "precision" performance of indoor positioning systems based on location fingerprinting are lacking. Such models can be...
MDM
2009
Springer
14 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...