496 search results - page 70 / 100 » Machine models and lower bounds for query processing |
137
Voted
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
134
Voted
COLT
2006
Springer
15 years 7 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
136
click to vote
NSDI
2004
15 years 5 months ago
2004
This paper focuses on load management in looselycoupled federated distributed systems. We present a distributed mechanism for moving load between autonomous participants using bil...
121
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
128
Voted
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...