Sciweavers

2957 search results - page 509 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IJCAI
2003
13 years 9 months ago
Simultaneous Adversarial Multi-Robot Learning
Multi-robot learning faces all of the challenges of robot learning with all of the challenges of multiagent learning. There has been a great deal of recent research on multiagent ...
Michael H. Bowling, Manuela M. Veloso
UAI
2001
13 years 9 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
VMV
2004
80views Visualization» more  VMV 2004»
13 years 9 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein
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,...