Sciweavers

718 search results - page 120 / 144
» Coloring quasi-line graphs
Sort
View
ICCV
2011
IEEE
14 years 1 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
CIE
2007
Springer
15 years 8 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 2 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
108
Voted
IPPS
2007
IEEE
15 years 8 months ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
16 years 7 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang