4117 search results - page 637 / 824 » On the Satisfiability of Complex Constraints |
167
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
192
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
201
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
A dynamic layer representation is proposed in this paper for tracking moving objects. Previous work on layered representations has largely concentrated on two-/multiframe batch fo...
173
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...
206
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...