836 search results - page 147 / 168 » Orthogonal Colorings of Graphs |
108
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
123
click to vote
MCAM
2007
Springer
15 years 7 months ago
2007
Springer
A three-level method is proposed to achieve robust and real-time ball tracking in soccer videos. It includes object-, intra-trajectory-, and intertrajectory-level processing. Due t...
127
click to vote
ICMI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we propose a multimodal system for detecting human activity and interaction patterns in a nursing home. Activities of groups of people are firstly treated as intera...
103
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
100
click to vote
CVPR
2000
IEEE
15 years 6 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 ...