5316 search results - page 123 / 1064 » Which Search Problems Are Random |
129
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
120
Voted
DAIS
2006
15 years 4 months ago
2006
Abstract. As the amount of information available to users continues to grow, filtering wanted items from unwanted ones becomes a dominant task. To this end, various collaborative-f...
148
click to vote
DAGSTUHL
1996
15 years 4 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
154
Voted
AUSAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
140
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...