1110 search results - page 150 / 222 » Clustering with the Connectivity Kernel |
148
click to vote
SIGMETRICS
2004
ACM
15 years 11 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
160
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
198
click to vote
ICCSA
2003
Springer
15 years 11 months ago
2003
Springer
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
162
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
137
click to vote
ICS
1999
Tsinghua U.
15 years 10 months ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...