Sciweavers

219 search results - page 32 / 44
» Time and Space Lower Bounds for Implementations Using k-CAS
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor
TCOM
2008
119views more  TCOM 2008»
13 years 8 months ago
Maximum likelihood detection for differential unitary space-time modulation with carrier frequency offset
Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)? This paper answers this question affirmative...
Feifei Gao, Tao Cui, Arumugam Nallanathan, Chintha...
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
14 years 10 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 8 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
JCSS
2008
90views more  JCSS 2008»
13 years 8 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger