Sciweavers

1973 search results - page 228 / 395
» The Construction of Ludic Space
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 12 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
CLUSTER
2004
IEEE
15 years 10 months ago
Cluster computing environment supporting single system image
Single system image(SSI) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a c...
Min Choi, DaeWoo Lee, Seung Ryoul Maeng
CONEXT
2008
ACM
15 years 8 months ago
Online estimation of RF interference
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
Nabeel Ahmed, Usman Ismail, Srinivasan Keshav, Kon...
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 6 months ago
Asymptotically-Good, Multigroup ML-Decodable STBCs
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
Natarajan Lakshmi Prasad, B. Sundar Rajan