Sciweavers

9842 search results - page 1772 / 1969
» Problem complexity
Sort
View
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 6 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 6 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
179
Voted
OSDI
2002
ACM
16 years 6 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 6 months ago
Answering Aggregation Queries in a Secure System Model
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past en...
Tingjian Ge, Stanley B. Zdonik
260
Voted
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 6 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
« Prev « First page 1772 / 1969 Last » Next »