Sciweavers

292 search results - page 11 / 59
» Scaling properties of the Internet graph
Sort
View
WIOPT
2006
IEEE
14 years 1 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
JMLR
2012
11 years 10 months ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 9 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
WWW
2002
ACM
13 years 7 months ago
A Query Language for XML Based on Graph Grammars
In this paper we present a graphical query language for XML. The language, based on a simple form of graph grammars, permits us to extract data and reorganize information in a new...
Sergio Flesca, Filippo Furfaro, Sergio Greco
IMC
2006
ACM
14 years 1 months ago
Measurement based analysis, modeling, and synthesis of the internet delay space
Understanding the characteristics of the Internet delay space (i.e., the all-pairs set of static round-trip propagation delays among edge networks in the Internet) is important fo...
Bo Zhang, T. S. Eugene Ng, Animesh Nandi, Rudolf H...