199 search results - page 14 / 40 » Recognizing HHDS-Free Graphs |
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we propose a novel multi-class graph boosting algorithm to recognize different visual objects. The proposed method treats subgraph as feature to construct base clas...
FOCS
1994
IEEE
14 years 2 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
AAAI
2004
13 years 11 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...