Sciweavers

4137 search results - page 610 / 828
» On the number of matchings of a tree
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Diagnosing Link-Level Anomalies Using Passive Probes
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...
Shipra Agrawal, K. V. M. Naidu, Rajeev Rastogi
INFOCOM
2007
IEEE
14 years 2 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 2 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
CALCO
2007
Springer
86views Mathematics» more  CALCO 2007»
14 years 2 months ago
Bootstrapping Types and Cotypes in HasCASL
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatype...
Lutz Schröder
CP
2007
Springer
14 years 2 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh