416 search results - page 15 / 84 » A Paradigm for Parallel Matrix Algorithms: |
160
click to vote
ICPR
2000
IEEE
16 years 6 months ago
2000
IEEE
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
132
click to vote
IPPS
1994
IEEE
15 years 9 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
161
click to vote
ICDAR
2003
IEEE
15 years 10 months ago
2003
IEEE
The use of artificial outputs generated by a classifier simulator has recently emerged as a new trend to provide an underlying evaluation of classifier combination methods. In thi...
148
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
119
click to vote
CLUSTER
2002
IEEE
15 years 10 months ago
2002
IEEE
In modern clustering environments where the memory hierarchy has many layers (distributed memory, shared memory layer, cache, ¡ ¢ ), an important question is how to fully u...