9209 search results - page 1579 / 1842 » Data Space Randomization |
166
click to vote
STOC
2001
ACM
16 years 5 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...
222
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
243
click to vote
VLDB
2007
ACM
16 years 5 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...
227
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
226
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...