108 search results - page 12 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Object detection in unconstrained images is an important image understanding problem with many potential applications. There has been little success in creating a single algorithm...
UAI
2008
13 years 9 months ago
2008
When related learning tasks are naturally arranged in a hierarchy, an appealing approach for coping with scarcity of instances is that of transfer learning using a hierarchical Ba...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
GG
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
ARSCOM
2004
13 years 7 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...