Sciweavers

2925 search results - page 417 / 585
» Information Complexity of Online Problems
Sort
View
SIGGRAPH
2000
ACM
15 years 7 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
AAAI
2007
15 years 6 months ago
Continuous State POMDPs for Object Manipulation Tasks
My research focus is on using continuous state partially observable Markov decision processes (POMDPs) to perform object manipulation tasks using a robotic arm. During object mani...
Emma Brunskill
NIPS
2007
15 years 5 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
DAGSTUHL
1998
15 years 5 months ago
Specification of Dynamics for Knowledge-Based Systems
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...
Pascal van Eck, Joeri Engelfriet, Dieter Fensel, F...
WSC
1998
15 years 5 months ago
A Workbench for Predicting the Performances of Distributed Object Architectures
The development of a Distributed Information System (DIS) can lead to critical bottlenecks because of the underlying architecture, which is becoming more and more complex. Todays ...
Sophie Dumas, Georges Gardarin