3020 search results - page 549 / 604 » Optimal partition trees |
141
click to vote
SSPR
2004
Springer
15 years 9 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
136
click to vote
STDBM
2004
Springer
15 years 9 months ago
2004
Springer
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
134
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
131
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents a simple and effective nonparametric approach to the problem of image parsing, or labeling image regions (in our case, superpixels produced by bottom-up segmen...
118
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...