Sciweavers

1192 search results - page 202 / 239
» Computing Weakest Readings
Sort
View
CHI
2002
ACM
16 years 2 months ago
SCANMail: a voicemail interface that makes speech browsable, readable and searchable
Increasing amounts of public, corporate, and private speech data are now available on-line. These are limited in their usefulness, however, by the lack of tools to permit their br...
Steve Whittaker, Julia Hirschberg, Brian Amento, L...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 2 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICALP
2009
Springer
16 years 2 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
SPAA
2009
ACM
15 years 11 months ago
Optimizing transactions for captured memory
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabat...
ICS
2009
Tsinghua U.
15 years 8 months ago
Zero-content augmented caches
It has been observed that some applications manipulate large amounts of null data. Moreover these zero data often exhibit high spatial locality. On some applications more than 20%...
Julien Dusser, Thomas Piquet, André Seznec