Sciweavers

2485 search results - page 25 / 497
» Time Bounded Frequency Computations
Sort
View
ALT
2004
Springer
15 years 8 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
MST
1998
76views more  MST 1998»
14 years 11 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
NAS
2010
IEEE
14 years 10 months ago
Time-Bounded Essential Localization for Wireless Sensor Networks
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
Wei Cheng, Nan Zhang 0004, Min Song, Dechang Chen,...
77
Voted
ICC
2007
IEEE
111views Communications» more  ICC 2007»
15 years 6 months ago
Composite Frequency-Offset Estimator for Wireless Communications
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
Zhuo Lu, Jiandong Li, Linjing Zhao, Yao Liu
DAC
2012
ACM
13 years 2 months ago
STM concurrency control for embedded real-time software with tighter time bounds
We consider software transactional memory (STM) concurrency control for multicore real-time software, and present a novel contention manager (CM) for resolving transactional con...
Mohammed El-Shambakey, Binoy Ravindran