Sciweavers

2219 search results - page 258 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
PPSN
1992
Springer
15 years 7 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ESCIENCE
2007
IEEE
15 years 7 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
101
Voted
MM
2010
ACM
163views Multimedia» more  MM 2010»
15 years 3 months ago
Multi-exposure imaging on mobile devices
Many natural scenes have a dynamic range that is larger than the dynamic range of a camera's image sensor. A popular approach to producing an image without under- and over-ex...
Natasha Gelfand, Andrew Adams, Sung Hee Park, Kari...
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 3 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre