Sciweavers

1298 search results - page 40 / 260
» The online set cover problem
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
ICDM
2009
IEEE
148views Data Mining» more  ICDM 2009»
15 years 4 months ago
Online System Problem Detection by Mining Patterns of Console Logs
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
15 years 3 months ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl
98
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
14 years 7 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
76
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 9 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham