Sciweavers

2957 search results - page 190 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IPL
2002
118views more  IPL 2002»
15 years 5 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
SI3D
2006
ACM
16 years 4 days ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
ATAL
2005
Springer
15 years 11 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
TNN
2010
216views Management» more  TNN 2010»
15 years 27 days ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
CA
2002
IEEE
15 years 11 months ago
Randomly Accessible Procedural Animation of Physically Approximate Turbulent Motion
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
Hui Fang, John C. Hart