871 search results - page 126 / 175 » The vertex-cover polynomial of a graph |
181
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
161
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
173
click to vote
CVPR
2007
IEEE
16 years 15 days ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
146
click to vote
JCO
2010
15 years 4 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...