Sciweavers

5329 search results - page 319 / 1066
» The Weighted Majority Algorithm
Sort
View
164
Voted
ICASSP
2010
IEEE
15 years 6 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
JDA
2007
97views more  JDA 2007»
15 years 6 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia

Publication
314views
17 years 5 months ago
LED: Load Early Detection: A Congestion Control Algorithm based on Router Traffic Load
Efficient bandwidth allocation and low delays remain important goals, expecially in high-speed networks. Existing end-to-end congestion control schemes (such as TCP+AQM/RED) have s...
A. Durresi, P. Kandikuppa, M. Sridharan, S. Chella...
CHI
2006
ACM
16 years 7 months ago
Time is of the essence: an evaluation of temporal compression algorithms
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
Simon Tucker, Steve Whittaker
FOCS
2008
IEEE
16 years 1 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan