1591 search results - page 170 / 319 » Random lifts of graphs |
184
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
158
click to vote
CVIU
2007
15 years 6 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
184
click to vote
WEBI
2005
Springer
15 years 12 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
136
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
172
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...