549 search results - page 78 / 110 » Computing All the Best Swap Edges Distributively |
IEEEPACT
2003
IEEE
15 years 3 months ago
2003
IEEE
Shared memory multiprocessor systems typically provide a set of hardware primitives in order to support synchronization. Generally, they provide single-word read-modify-write hard...
102
click to vote
PR
2006
14 years 9 months ago
2006
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
59
Voted
ISCA
1997
IEEE
15 years 1 months ago
1997
IEEE
DataScalar architectures improve memory system performance by running computation redundantly across multiple processors, which are each tightly coupled with an associated memory....
ICVGIP
2008
14 years 11 months ago
2008
We investigate to what extent combinations of features can improve classification performance on a large dataset of similar classes. To this end we introduce a 103 class flower da...
DAGSTUHL
2004
14 years 11 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...