Sciweavers

13214 search results - page 2547 / 2643
» Pseudorandomness for network algorithms
Sort
View
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 4 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
16 years 4 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
EDBT
2006
ACM
190views Database» more  EDBT 2006»
16 years 4 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
16 years 1 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
« Prev « First page 2547 / 2643 Last » Next »