1091 search results - page 206 / 219 » Approximation Algorithms for Data Placement Problems |
TSP
2010
13 years 2 months ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
TON
2002
13 years 7 months ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...