Sciweavers

2004 search results - page 125 / 401
» Sampling from large graphs
Sort
View
VLDB
2007
ACM
139views Database» more  VLDB 2007»
15 years 9 months ago
A Bayesian Method for Guessing the Extreme Values in a Data Set
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
Mingxi Wu, Chris Jermaine
ICPR
2010
IEEE
15 years 13 days ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
IEAAIE
2005
Springer
15 years 8 months ago
Analyzing Multi-level Spatial Association Rules Through a Graph-Based Visualization
Association rules discovery is a fundamental task in spatial data mining where data are naturally described at multiple levels of granularity. ARES is a spatial data mining system ...
Annalisa Appice, Paolo Buono
IJCV
1998
153views more  IJCV 1998»
15 years 2 months ago
Rational Filters for Passive Depth from Defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. The performance of previously proposed focus operators are inevitably sensitive t...
Masahiro Watanabe, Shree K. Nayar
CIKM
2009
Springer
15 years 9 months ago
Mining tourist information from user-supplied collections
Tourist photographs constitute a large part of the images uploaded to photo sharing platforms. But filtering methods are needed before one can extract useful knowledge from noisy ...
Adrian Popescu, Gregory Grefenstette, Pierre-Alain...