12194 search results - page 2031 / 2439 » Numberings Optimal for Learning |
215
click to vote
STOC
2003
ACM
16 years 8 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
205
click to vote
STOC
2001
ACM
16 years 8 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
230
click to vote
STOC
2001
ACM
16 years 8 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
302
click to vote
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many fa...
278
click to vote
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...