Sciweavers

4155 search results - page 440 / 831
» Topic-Specific Optimization and Structuring
Sort
View
UAI
2003
15 years 8 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
VMV
2003
164views Visualization» more  VMV 2003»
15 years 8 months ago
A Parallel Framework for Silhouette-Based Human Motion Capture
This paper presents a method to capture human motion from silhouettes of a person in multi-view video streams. Applying a hierarchical kinematic body model motion parameters are e...
Christian Theobalt, Joel Carranza, Marcus A. Magno...
UAI
1998
15 years 8 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
PUK
2000
15 years 8 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
ISMB
1996
15 years 8 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...