3008 search results - page 214 / 602 » Independence in connected graphs |
380
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
185
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
169
click to vote
IICS
2003
Springer
15 years 11 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
199
Voted
IJCAI
2003
15 years 8 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
184
click to vote
JCT
2007
15 years 6 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...