Sciweavers

1525 search results - page 273 / 305
» Matching with Regular Constraints
Sort
View
NIPS
2000
14 years 6 days ago
Feature Correspondence: A Markov Chain Monte Carlo Approach
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume tha...
Frank Dellaert, Steven M. Seitz, Sebastian Thrun, ...
EUROGRAPHICS
2010
Eurographics
13 years 12 months ago
User Controllable Color Transfer
This paper presents an image editing framework where users use reference images to indicate desired color edits. In our approach, users specify pairs of strokes to indicate corres...
Xiaobo An and Fabio Pellacini
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 11 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 11 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
BMCBI
2006
141views more  BMCBI 2006»
13 years 11 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings