177 search results - page 26 / 36 » Uniform Hashing in Constant Time and Optimal Space |
191
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
112
Voted
ML
2008
ACM
15 years 20 days ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
113
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
104
Voted
DEXAW
1999
IEEE
15 years 5 months ago
1999
IEEE
Requirements engineering ranks as one of the most difficult and error-prone phases in the life cycle of devices such as mobile telephones. It is of critical importance because of ...
107
Voted
AI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...