1127 search results - page 61 / 226 » Testing the Expansion of a Graph |
ISVC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper, we present a novel graph, sub-graph and supergraph based face representation which captures the facial shape changes and deformations caused due to pose ch...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
PODC
2009
ACM
15 years 4 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
110
click to vote
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
103
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...