Sciweavers

19320 search results - page 307 / 3864
» On the complexity of computing determinants
Sort
View
CAD
2000
Springer
15 years 6 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
TOG
2002
208views more  TOG 2002»
15 years 6 months ago
Video matting of complex scenes
This paper describes a new framework for video matting, the process of pulling a high-quality alpha matte and foreground from a video sequence. The framework builds upon technique...
Yung-Yu Chuang, Aseem Agarwala, Brian Curless, Dav...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 5 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
ACSC
2005
IEEE
16 years 10 days ago
Real-time Monocular Tracking of View Frustum for Large Screen Human-Computer Interaction
This paper introduces a novel approach towards direct interaction with large display systems. Monocular computer vision is utilised to avoid restraints imposed by input devices. T...
Kelvin Cheng, Masahiro Takatsuka
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
15 years 11 months ago
Optimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
Peichen Pan, Guohua Chen