Sciweavers

2479 search results - page 334 / 496
» Quantum complexity theory
Sort
View
CHI
2007
ACM
16 years 6 months ago
Supporting multidisciplinary collaboration: requirements from novel HCI education
Many collaborative design tools may suffer from being too generic to address the specific complexities inherent in multidisciplinary collaboration. We provide accounts of several ...
Piotr D. Adamczyk, Michael B. Twidale
POPL
2003
ACM
16 years 6 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
CADE
2008
Springer
16 years 6 months ago
Model Stack for the Pervasive Verification of a Microkernel-based Operating System
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
Jan Dörrenbächer, Matthias Daum, Sebasti...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 6 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano