Sciweavers

552 search results - page 71 / 111
» Lower bounds for dynamic connectivity
Sort
View
TPDS
2010
222views more  TPDS 2010»
13 years 6 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
HPDC
2006
IEEE
14 years 2 months ago
Toward Self Organizing Grids
— The potential of truly large scale grids can only be realized with grid architectures and deployment strategies that lower the need for human administrative intervention, and t...
Nael B. Abu-Ghazaleh, Michael J. Lewis
INTERSPEECH
2010
13 years 2 months ago
Using a DBN to integrate sparse classification and GMM-based ASR
The performance of an HMM-based speech recognizer using MFCCs as input is known to degrade dramatically in noisy conditions. Recently, an exemplar-based noise robust ASR approach,...
Yang Sun, Jort F. Gemmeke, Bert Cranen, Louis ten ...
MOBIHOC
2004
ACM
14 years 7 months ago
Locating cache proxies in manets
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...
Roy Friedman, Maria Gradinariu, Gwendal Simon
ICALP
2001
Springer
14 years 13 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan