Sciweavers

3913 search results - page 186 / 783
» complexity 2006
Sort
View
CORR
2006
Springer
97views Education» more  CORR 2006»
15 years 4 months ago
Improved Nearly-MDS Expander Codes
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
Ron M. Roth, Vitaly Skachek
VTC
2006
IEEE
129views Communications» more  VTC 2006»
15 years 10 months ago
Practicable MIMO Capacity in Ideal Channels
— The impact of communications signal processing such as QAM modulations (instead of gaussian signals), finite block lengths (instead of infinitely long codes), and using simpl...
S. Amir Mirtaheri, Rodney G. Vaughan
ACNS
2006
Springer
138views Cryptology» more  ACNS 2006»
15 years 8 months ago
Syntax-Driven Private Evaluation of Quantified Membership Queries
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
Aggelos Kiayias, Antonina Mitrofanova
E4MAS
2006
Springer
15 years 8 months ago
Exploiting the Environment for Coordinating Agent Intentions
One large and quite interesting family of MAS applications is characterized (1) by their large scale in terms of number of agents and physical distribution, (2) by their very dynam...
Tom Holvoet, Paul Valckenaers
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
15 years 8 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris