Sciweavers

995 search results - page 42 / 199
» complexity 2011
Sort
View
144
Voted
TWC
2011
275views more  TWC 2011»
14 years 9 months ago
A Novel Uplink Multiple Access Scheme Based on TDS-FDMA
—This contribution proposes a novel time-domain synchronous frequency division multiple access (TDS-FDMA) scheme to support multi-user uplink application. A unified frame struct...
Linglong Dai, Zhaocheng Wang, Sheng Chen
FOCM
2011
96views more  FOCM 2011»
14 years 6 months ago
Persistent Intersection Homology
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
Paul Bendich, John Harer
138
Voted
JSC
2011
99views more  JSC 2011»
14 years 5 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
144
Voted
FEDCSIS
2011
76views more  FEDCSIS 2011»
14 years 2 months ago
Search--Based Testing, the Underlying Engine of Future Internet Testing
Abstract—The Future Internet will be a complex interconnection of services, applications, content and media, on which our society will become increasingly dependent. Time to mark...
Arthur I. Baars, Kiran Lakhotia, Tanja E. J. Vos, ...
IACR
2011
124views more  IACR 2011»
14 years 2 months ago
Zero-Correlation Linear Cryptanalysis of Block Ciphers
Linear cryptanalysis, along with differential cryptanalysis, is an important tool to evaluate the security of block ciphers. This work introduces a novel extension of linear crypt...
Andrey Bogdanov, Vincent Rijmen