5092 search results - page 672 / 1019 » Clustering the Feature Space |
167
click to vote
SAC
2004
ACM
16 years 6 days ago
2004
ACM
This paper presents an overview of our work, concerning a complete end-to-end framework for automatically generating message passing parallel code for tiled nested for-loops. It c...
195
Voted
WIDM
2004
ACM
16 years 6 days ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
189
click to vote
CIKM
2004
Springer
16 years 6 days ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
188
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
188
Voted
PAKDD
2004
ACM
16 years 4 days ago
2004
ACM
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...