Sciweavers

1778 search results - page 161 / 356
» The Theory of Probabilistic Databases
Sort
View
ICCV
2005
IEEE
16 years 8 months ago
A Maximum Entropy Framework for Part-Based Texture and Object Recognition
This paper presents a probabilistic part-based approach for texture and object recognition. Textures are represented using a part dictionary found by quantizing the appearance of ...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
16 years 7 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
VLDB
2007
ACM
129views Database» more  VLDB 2007»
16 years 13 days 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...
ICPR
2000
IEEE
15 years 10 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 10 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....