Sciweavers

287 search results - page 49 / 58
» Communication complexity as a lower bound for learning in ga...
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
IWQOS
2001
Springer
14 years 1 months ago
QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
Baochun Li
INFOCOM
2000
IEEE
14 years 1 months ago
Wavelength Assignment in WDM Rings to Minimize SONET ADMs
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
Liwu Liu, Xiang-Yang Li, Peng-Jun Wan, Ophir Fried...
MA
2010
Springer
132views Communications» more  MA 2010»
13 years 7 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
GLOBECOM
2010
IEEE
13 years 6 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo