142 search results - page 24 / 29 » On the Independent Domination Number of Random Regular Graph... |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
JDWM
2010
13 years 6 months ago
2010
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
ACTA
2006
13 years 7 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...