Sciweavers

1308 search results - page 214 / 262
» Let's Have a Conversation
Sort
View
POPL
2008
ACM
15 years 11 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
POPL
2008
ACM
15 years 11 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
178
Voted
SIGMOD
2009
ACM
138views Database» more  SIGMOD 2009»
15 years 11 months ago
PRIMA: archiving and querying historical data with evolving schemas
Schema evolution poses serious challenges in historical data management. Traditionally historical data have been archived either by (i) migrating them into the current schema vers...
Hyun J. Moon, Carlo Curino, MyungWon Ham, Carlo Za...
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
15 years 8 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 8 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...