Sciweavers

176 search results - page 16 / 36
» Fast Periodic Correction Networks
Sort
View
INFOCOM
2010
IEEE
14 years 8 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
UAI
1997
14 years 10 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang
GLOBECOM
2007
IEEE
15 years 3 months ago
Non-Cooperative Dynamic Spectrum Access for CDMA Networks
— Recent studies indicate the presence of a significant amount of idle licensed spectrum, in different time periods and geographic locations. Prompted by the latest regulatory ch...
George Alyfantis, Giannis F. Marias, Stathes Hadji...
ICASSP
2010
IEEE
14 years 9 months ago
Redundant representation for network video streaming using reconstructed P-frames and SP-frames
For low-delay streaming of pre-encoded video over lossy networks, fast recovery from decoding errors typically involves use of frequent intra-coded frames, which incurs high bandw...
Gene Cheung, Wai-tian Tan
COR
2004
146views more  COR 2004»
14 years 9 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella