114 search results - page 12 / 23 » An efficient condition for a graph to be Hamiltonian |
IJCV
2008
13 years 7 months ago
2008
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
COMBINATORICS
2006
13 years 7 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...