237 search results - page 17 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
SSD
2007
Springer
14 years 2 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Web Mining Systems exploit the redundancy of data published on the Web to automatically extract information from existing web documents. The first step in the Information Extract...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...