76 search results - page 3 / 16 » Random Edge Can Be Exponential on Abstract Cubes |
PAMI
2008
14 years 9 months ago
2008
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
JCO
2010
14 years 7 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
DAM
2008
14 years 9 months ago
2008
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
FSTTCS
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...