4541 search results - page 75 / 909 » Cache-Oblivious Algorithms and Data Structures |
IJON
2011
14 years 2 months ago
2011
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
SIGIR
2010
ACM
14 years 9 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
106
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
ICDM
2005
IEEE
15 years 4 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
117
click to vote
FTCGV
2011
14 years 2 months ago
2011
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...