Sciweavers

983 search results - page 20 / 197
» Negative-Weight Cycle Algorithms
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
EUC
2006
Springer
15 years 6 months ago
Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
Yean-Fu Wen, Frank Yeong-Sung Lin
INFOCOM
2010
IEEE
15 years 1 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
ICIP
2009
IEEE
15 years 25 days ago
Best basis denoising with non-stationary wavelet packets
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...
Nizar Ouarti, Gabriel Peyré
DAM
2011
14 years 10 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...