Sciweavers

30570 search results - page 5674 / 6114
» An Image Data Model
Sort
View
180
Voted
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 7 months ago
On the cell probe complexity of membership and perfect hashing
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...
Rasmus Pagh
187
Voted
OSDI
2002
ACM
16 years 7 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin
268
Voted
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 7 months ago
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
Nesime Tatbul, Stanley B. Zdonik, Ugur Çeti...
268
Voted
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
16 years 7 months ago
Query segmentation using conditional random fields
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
Xiaohui Yu, Huxia Shi
« Prev « First page 5674 / 6114 Last » Next »