Sciweavers

1486 search results - page 94 / 298
» Algorithms for two-box covering
Sort
View
110
Voted
TCOM
2008
88views more  TCOM 2008»
15 years 3 months ago
Maximum likelihood based estimation of frequency and phase offset in DCT OFDM systems under non-circular transmissions: algorith
Recently, the advantages of the discrete cosine transform (DCT) based orthogonal frequency-division multiplexing (OFDM) have come to the light. We thus consider DCTOFDM with non-ci...
Feifei Gao, Tao Cui, Arumugam Nallanathan, Chintha...
WIOPT
2006
IEEE
15 years 10 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
MP
2007
95views more  MP 2007»
15 years 3 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
SAC
2008
ACM
15 years 3 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...
WG
2010
Springer
15 years 2 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang