Sciweavers

1937 search results - page 178 / 388
» Conditioning Probabilistic Databases
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
15 years 5 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
103
Voted
COMPGEOM
2004
ACM
15 years 4 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
ICPR
2000
IEEE
15 years 3 months ago
Integrating Unlabeled Images for Image Retrieval Based on Relevance Feedback
Retrieval techniques based on pure similarity metrics are often suffered from the scales of image features. An alternative approach is to learn a mapping based on queries and rele...
Ying Wu, Qi Tian, Thomas S. Huang
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 3 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
92
Voted
DEXAW
2004
IEEE
132views Database» more  DEXAW 2004»
15 years 2 months ago
Using Data-Flow Analysis for Resilience and Result Checking in Peer-To-Peer Computations
To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checki...
Samir Jafar, Sébastien Varrette, Jean-Louis...