Sciweavers

177 search results - page 29 / 36
» Uniform Hashing in Constant Time and Optimal Space
Sort
View
105
Voted
AAAI
1996
15 years 2 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
114
Voted
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 7 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
107
Voted
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 5 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
146
Voted
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 7 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
PODC
2005
ACM
15 years 6 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer