Sciweavers

351 search results - page 27 / 71
» An exact method for graph coloring
Sort
View
DM
2008
103views more  DM 2008»
13 years 7 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
PAMI
2006
111views more  PAMI 2006»
13 years 7 months ago
Stereo Matching with Linear Superposition of Layers
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
ICIAP
2003
ACM
14 years 7 months ago
A feature-based face recognition system
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determine...
Paola Campadelli, Raffaella Lanzarotti, C. Savazzi
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
14 years 4 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...