617 search results - page 69 / 124 » Patterns for decoupling data structures and algorithms |
NIPS
2004
13 years 9 months ago
2004
Recently, there have been several advances in the machine learning and pattern recognition communities for developing manifold learning algorithms to construct nonlinear low-dimen...
TSI
2008
13 years 7 months ago
2008
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
TIP
2010
13 years 6 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
ICAPR
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...