Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
— In this paper, we propose a theoretical framework for the analysis of the impact of ultra–wideband (UWB) interference on systems that use the popular combination of bit– in...
Abstract— This paper deals with the problem of blind multiuser detection in multirate direct-sequence code division multiple access (DS-CDMA). Direct-Sequence Spread Spectrum (DS...
“Objects-first” is an increasingly popular strategy for teaching object-oriented programming by introducing the concepts of objects, classes, and instances before procedural e...
Sally H. Moritz, Fang Wei, Shahida M. Parvez, Glen...