25 search results - page 5 / 5 » Graph Isomorphism is in the Low Hierarchy |
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
CVPR
2000
IEEE
13 years 9 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
CSIE
2009
IEEE
13 years 11 months ago
2009
IEEE
—For improving the efficiency of human 3D tracking, we present an algorithm to track 3D Arm Motion. First, the Hierarchy Limb Model (HLM) is proposed based on the human 3D skelet...
INFOVIS
2003
IEEE
13 years 10 months ago
2003
IEEE
Many networks under study in Information Visualization are “small world” networks. These networks first appeared in the study social networks and were shown to be relevant mod...
FGR
2008
IEEE
13 years 5 months ago
2008
IEEE
A key point in automatic age estimation is to design feature set essential to age perception. To achieve this goal, this paper builds up a hierarchical graphical face model for fa...