Sciweavers

3007 search results - page 532 / 602
» Designing for collective remembering
Sort
View
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 11 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
VLDB
2004
ACM
128views Database» more  VLDB 2004»
15 years 11 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
VLDB
2004
ACM
104views Database» more  VLDB 2004»
15 years 11 months ago
Retrieval effectiveness of an ontology-based model for information selection
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...
Latifur Khan, Dennis McLeod, Eduard H. Hovy
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 11 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
15 years 11 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan