5046 search results - page 324 / 1010 » Non-redundant data clustering |
157
click to vote
GFKL
2007
Springer
16 years 29 days ago
2007
Springer
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
182
Voted
EUROPAR
2003
Springer
16 years 10 hour ago
2003
Springer
Abstract. Performance analysis for terascale computing requires a combination of new concepts including distribution, on-line processing and automation. As a foundation for tools r...
183
click to vote
ISAAC
2004
Springer
16 years 4 days ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
222
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
This paper addresses the problem of learning similaritypreserving binary codes for efficient retrieval in large-scale image collections. We propose a simple and efficient altern...
205
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...