Sciweavers

501 search results - page 77 / 101
» Rough Sets and Approximation Schemes
Sort
View
SIGGRAPH
1992
ACM
14 years 3 months ago
An importance-driven radiosity algorithm
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
Brian E. Smits, James Arvo, David Salesin
3DPVT
2006
IEEE
231views Visualization» more  3DPVT 2006»
14 years 2 months ago
Simplified Belief Propagation for Multiple View Reconstruction
We address multiple-view reconstruction under an optimization approach based on belief propagation. A novel formulation of belief propagation that operates in 3-D is proposed to f...
E. Scott Larsen, Philippos Mordohai, Marc Pollefey...
ACID
2006
239views Algorithms» more  ACID 2006»
14 years 17 days ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
QUESTA
2006
101views more  QUESTA 2006»
13 years 11 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
JAIR
2010
130views more  JAIR 2010»
13 years 6 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger