Sciweavers

6542 search results - page 1260 / 1309
» The tao of parallelism in algorithms
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 9 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
ICS
2010
Tsinghua U.
14 years 6 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
ICS
2010
Tsinghua U.
14 years 6 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
14 years 6 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
PEPM
2009
ACM
14 years 5 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
« Prev « First page 1260 / 1309 Last » Next »