433 search results - page 67 / 87 » Optimal Segmentation of Random Sequences |
135
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
One problem in concatenative speech synthesis is how to incorporate prosodic factors in the unit selection. Imposing a predicted prosodic target is error-prone and does not benefi...
143
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
138
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
141
click to vote
CVPR
2009
IEEE
17 years 5 days ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
157
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...