2957 search results - page 309 / 592 » The Complexity of Polynomial-Time Approximation |
206
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
177
click to vote
UAI
2004
15 years 8 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
200
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many temporal processes can be naturally modeled as a stochastic system that evolves continuously over time. The representation language of continuous-time Bayesian networks allow...
199
click to vote
CGF
2008
15 years 6 months ago
2008
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
184
click to vote
JOLLI
2006
15 years 6 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...