Sciweavers

1968 search results - page 161 / 394
» The Complexity of Valued Constraint Models
Sort
View
KI
2007
Springer
15 years 4 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
ICASSP
2011
IEEE
14 years 8 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
PADS
2009
ACM
15 years 11 months ago
An Approach for Validation of Semantic Composability in Simulation Models
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
Claudia Szabo, Yong Meng Teo
ICML
2004
IEEE
16 years 5 months ago
Generative modeling for continuous non-linearly embedded visual inference
Many difficult visual perception problems, like 3D human motion estimation, can be formulated in terms of inference using complex generative models, defined over high-dimensional ...
Cristian Sminchisescu, Allan D. Jepson
CVPR
2003
IEEE
16 years 6 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