Sciweavers

613 search results - page 105 / 123
» Finding and Fixing Faults
Sort
View
COCOON
2008
Springer
14 years 11 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
14 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
BMCBI
2007
144views more  BMCBI 2007»
14 years 9 months ago
Robust regression for periodicity detection in non-uniformly sampled time-course gene expression data
Background: In practice many biological time series measurements, including gene microarrays, are conducted at time points that seem to be interesting in the biologist's opin...
Miika Ahdesmäki, Harri Lähdesmäki, ...
SIGMETRICS
2008
ACM
14 years 9 months ago
Ironmodel: robust performance models in the wild
Traditional performance models are too brittle to be relied on for continuous capacity planning and performance debugging in many computer systems. Simply put, a brittle model is ...
Eno Thereska, Gregory R. Ganger
TIT
2008
141views more  TIT 2008»
14 years 9 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli