Sciweavers

248 search results - page 19 / 50
» Parameterized Algorithms for Directed Maximum Leaf Problems
Sort
View
CORR
2006
Springer
164views Education» more  CORR 2006»
14 years 9 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
93
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Optimal Scheduling Algorithms for Input-Queued Switches
— The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high line speeds. A central problem in designing an input-queued swit...
Devavrat Shah, Damon Wischik
81
Voted
PODS
2004
ACM
148views Database» more  PODS 2004»
15 years 9 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
78
Voted
IPCCC
2007
IEEE
15 years 3 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
SECON
2010
IEEE
14 years 7 months ago
Placement and Orientation of Rotating Directional Sensors
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
Giordano Fusco, Himanshu Gupta