Sciweavers

104 search results - page 3 / 21
» An Efficient Random Jitter Measurement Technique Using Fast ...
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
A Square-Root Sampling Approach to Fast Histogram-Based Search
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
Huang-Wei Chang, Hwann-Tzong Chen
PVLDB
2008
110views more  PVLDB 2008»
13 years 5 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 6 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
PODC
2009
ACM
14 years 6 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
ICDE
2006
IEEE
142views Database» more  ICDE 2006»
14 years 7 months ago
End-biased Samples for Join Cardinality Estimation
We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network tr...
Cristian Estan, Jeffrey F. Naughton