217 search results - page 36 / 44 » On the Fine Structure of Large Search Spaces |
109
click to vote
SODA
1993
ACM
15 years 29 days ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
102
click to vote
SIGMOD
2000
ACM
15 years 4 months ago
2000
ACM
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
125
click to vote
TIP
1998
14 years 11 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...