2520 search results - page 324 / 504 » The complexity of approximating entropy |
171
click to vote
UAI
2008
15 years 8 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...
169
click to vote
RSS
2007
15 years 8 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...
171
click to vote
CGVR
2006
15 years 8 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...
175
click to vote
VMV
2003
15 years 8 months ago
2003
In this paper we present techniques for the real-time simulation and rendering of liquids. Appropriate approximations to a full 3D simulation are applied to reduce the numerical c...
168
click to vote
MVA
1998
15 years 7 months ago
1998
In order to recognize plant species from their shapes, shapes of contours of leaves can be used. However, contours of leaves are complicated and have variations. In order to deal ...