335 search results - page 31 / 67 » Resolvent of large random graphs |
176
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
138
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
144
click to vote
TSP
2008
15 years 3 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
154
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—We provide a new outer bound on the capacity region of the two-user Gaussian multiple access channel (MAC) with AWGN-corrupted feedback. Our outer bound is based on the idea of ...
118
click to vote
WEA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...