1700 search results - page 193 / 340 » Combinatorial Pattern Matching |
CVPR
2008
IEEE
15 years 17 days ago
2008
IEEE
In this paper, we propose a novel dynamic discrete framework to address image morphing with application to optical flow estimation. We reformulate the problem using a number of di...
MICCAI
2007
Springer
14 years 11 months ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
WINE
2009
Springer
14 years 5 months ago
2009
Springer
We study the problem of designing prediction markets for random variables with continuous or countably infinite outcomes on the real line. Our interval betting languages allow tra...
IPPS
2008
IEEE
14 years 5 months ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...