11211 search results - page 1914 / 2243 » Rank-Sensitive Data Structures |
133
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
156
Voted
STOC
2001
ACM
16 years 4 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...
112
Voted
OSDI
2004
ACM
16 years 4 months ago
2004
ACM
Abstractions as the Foundation for Storage Infrastructure John MacCormick, Nick Murphy, Marc Najork, Chandramohan A. Thekkath, and Lidong Zhou Microsoft Research Silicon Valley Wr...
227
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
239
Voted
VLDB
2008
ACM
16 years 4 months ago
2008
ACM
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...