Sciweavers

1429 search results - page 231 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
AAAI
2007
13 years 10 months ago
Purely Epistemic Markov Decision Processes
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
Régis Sabbadin, Jérôme Lang, N...
ATAL
2008
Springer
13 years 9 months ago
Reinforcement learning for DEC-MDPs with changing action sets and partially ordered dependencies
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
Thomas Gabel, Martin A. Riedmiller
COMPGEOM
2005
ACM
13 years 9 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
NIPS
2003
13 years 9 months ago
Attractive People: Assembling Loose-Limbed Models using Non-parametric Belief Propagation
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
Leonid Sigal, Michael Isard, Benjamin H. Sigelman,...
WSCG
2003
177views more  WSCG 2003»
13 years 9 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein