Sciweavers

4524 search results - page 614 / 905
» The Complexity of Global Constraints
Sort
View
PROMISE
2010
15 years 2 months ago
The relationship between search based software engineering and predictive modeling
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...
Mark Harman
188
Voted
ICASSP
2011
IEEE
14 years 11 months ago
Using F0 to constrain the unit selection Viterbi network
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...
Alistair Conkie, Ann K. Syrdal
VLDB
1991
ACM
179views Database» more  VLDB 1991»
15 years 11 months ago
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
Antonio Albano, Giorgio Ghelli, Renzo Orsini
191
Voted
CVPR
2003
IEEE
16 years 9 months ago
A 2D Moving Grid Geometric Deformable Model
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...
Xiao Han, Chenyang Xu, Jerry L. Prince
241
Voted
ECCV
2008
Springer
16 years 9 months ago
Quick Shift and Kernel Methods for Mode Seeking
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...
Andrea Vedaldi, Stefano Soatto