2957 search results - page 413 / 592 » The Complexity of Polynomial-Time Approximation |
134
click to vote
NIPS
2007
15 years 7 months ago
2007
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
164
click to vote
UAI
2008
15 years 7 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
163
click to vote
RSS
2007
15 years 7 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
167
click to vote
CGVR
2006
15 years 7 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
128
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...