Sciweavers

196 search results - page 13 / 40
» Globally optimal bilinear programming for computer vision ap...
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Global Illumination Compensation for Spatially Augmented Reality
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
Yu Sheng, Theodore C. Yapo, Barbara Cutler
CVPR
2008
IEEE
14 years 9 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
KBSE
1997
IEEE
13 years 11 months ago
Application of Formal Methods to the Development of a Software Maintenance Tool
Partial evaluation is an optimization technique traditionally used in compilation. We have adapted this technique to the understanding of scientic application programs during t...
Sandrine Blazy, Philippe Facon
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
13 years 12 months ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg
MP
2008
135views more  MP 2008»
13 years 7 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye