5100 search results - page 325 / 1020 » The Linear Complexity of a Graph |
141
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
139
Voted
SIROCCO
1998
15 years 6 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
140
click to vote
CVGIP
2004
15 years 4 months ago
2004
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
136
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
127
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...