4541 search results - page 559 / 909 » Cache-Oblivious Algorithms and Data Structures |
224
click to vote
SODA
1993
ACM
15 years 8 months 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...
213
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
233
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
197
click to vote
ICCV
2007
IEEE
16 years 9 months ago
2007
IEEE
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...
153
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...