1952 search results - page 233 / 391 » Complete partitions of graphs |
130
click to vote
ICRA
2005
IEEE
16 years 4 days ago
2005
IEEE
– This paper describes a new algorithm for the efficient mass-matrix inversion of serial manipulators. Whereas several well-known O(n) algorithms already exist, our presentation ...
178
click to vote
ICS
2005
Tsinghua U.
16 years 1 days ago
2005
Tsinghua U.
We propose an organization for the on-chip memory system of a chip multiprocessor, in which 16 processors share a 16MB pool of 256 L2 cache banks. The L2 cache is organized as a n...
190
click to vote
NIPS
2004
15 years 8 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
160
click to vote
PR
2006
15 years 6 months ago
2006
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
157
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...