4541 search results - page 419 / 909 » Cache-Oblivious Algorithms and Data Structures |
136
click to vote
POPL
1998
ACM
15 years 9 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
149
Voted
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
130
click to vote
NIPS
2004
15 years 6 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...
139
click to vote
TSI
2008
15 years 4 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 ...
164
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...