Sciweavers

610 search results - page 26 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
133
Voted
DPD
2010
153views more  DPD 2010»
14 years 10 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
181
Voted
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
16 years 19 days ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
212
Voted
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
16 years 19 days ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
116
Voted
TKDE
2010
274views more  TKDE 2010»
14 years 11 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
ICIP
2010
IEEE
14 years 10 months ago
Dynamic selection of a feature-rich query frame for mobile video retrieval
In this paper, we focus on a new application of mobile visual search: snapping a photo with a mobile device of a video playing on a TV screen to automatically retrieve and stream ...
David M. Chen, Ngai-Man Cheung, Sam S. Tsai, Vijay...