820 search results - page 133 / 164 » Inducing Temporal Graphs |
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
JCDL
2010
ACM
15 years 3 months ago
2010
ACM
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
120
click to vote
ALT
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
130
click to vote
IJCAI
2007
15 years 3 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
111
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...