4560 search results - page 134 / 912 » Finding Data in the Neighborhood |
DEXA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
There are many computer vision algorithms developed for visual (scene and object) recognition. Some systems focus on involved learning algorithms, some leverage millions of trainin...
CANDC
2005
ACM
13 years 8 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...