Sciweavers

2520 search results - page 421 / 504
» The complexity of approximating entropy
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 5 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»
15 years 5 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
15 years 5 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,...
RANLP
2003
15 years 5 months ago
Combining independent modules in lexical multiple-choice problems
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
Peter D. Turney, Michael L. Littman, Jeffrey Bigha...
AAAI
1998
15 years 5 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell