Sciweavers

39 search results - page 8 / 8
» Path-Based Supports for Hypergraphs
Sort
View
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 2 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
13 years 9 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri
KAIS
2006
247views more  KAIS 2006»
13 years 10 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
CN
2006
84views more  CN 2006»
13 years 11 months ago
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, tran...
Yong Zhu, Constantinos Dovrolis, Mostafa H. Ammar