Sciweavers

5624 search results - page 292 / 1125
» On Conditional Covering Problem
Sort
View
TIT
2008
66views more  TIT 2008»
15 years 6 months ago
State Amplification
We consider the problem of transmitting data at rate over a state-dependent channel with state information available at the sender and at the same time conveying the information ab...
Young-Han Kim, Arak Sutivong, Thomas M. Cover
IJCGA
2000
85views more  IJCGA 2000»
15 years 6 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
ORDER
2007
89views more  ORDER 2007»
15 years 6 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
SAC
2008
ACM
15 years 6 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
ICASSP
2010
IEEE
15 years 5 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega