Sciweavers

4934 search results - page 606 / 987
» complexity 2008
Sort
View
TCOM
2008
124views more  TCOM 2008»
15 years 6 months ago
Reliable adaptive modulation and interference mitigation for mobile radio slow frequency hopping channels
: Due to correlated fading in frequency hopping (FH) wireless communication systems, it is possible to predict the future channel state information (CSI) for one frequency based on...
Ming Lei, Alexandra Duel-Hallen, Hans Hallen
TCOM
2008
75views more  TCOM 2008»
15 years 6 months ago
Transmitter-based processing for down-link DS/CDMA systems with multiple transmit antennas
In cellular wireless communication systems, there have been various receiver-based techniques for performance improvement. However, it may be desirable to use transmitterbased tech...
Chang Park, Kwang Lee
TCS
2008
15 years 6 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles
IPL
2007
111views more  IPL 2007»
15 years 6 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
TCS
2008
15 years 6 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...