Sciweavers

1056 search results - page 152 / 212
» Constraint-Based Graph Matching
Sort
View
DGCI
2009
Springer
14 years 10 days ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
CVPR
2005
IEEE
14 years 11 months ago
Bi-Layer Segmentation of Binocular Stereo Video
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
ICML
2009
IEEE
14 years 10 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
14 years 3 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
FOCS
2003
IEEE
14 years 2 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis