Sciweavers

545 search results - page 55 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 9 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICPP
2005
IEEE
15 years 9 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
BMCBI
2010
185views more  BMCBI 2010»
15 years 4 months ago
ABCtoolbox: a versatile toolkit for approximate Bayesian computations
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
Daniel Wegmann, Christoph Leuenberger, Samuel Neue...
FSTTCS
2009
Springer
15 years 10 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
134
Voted
INFOCOM
2007
IEEE
15 years 10 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