Sciweavers

24 search results - page 1 / 5
» Some Recent Results on Pie Cutting
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
DISOPT
2011
175views Education» more  DISOPT 2011»
12 years 11 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
ICIP
2007
IEEE
13 years 11 months ago
A Novel Facial Feature Point Localization Method on 3D Faces
Although 2D-based face recognition methods have made great progress in the past decades, there are also some unsolved problems such as PIE. Recently, more and more researchers hav...
Peng Guan, Yaoliang Yu, Liming Zhang
LICS
2007
IEEE
14 years 1 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen