Sciweavers

6251 search results - page 1197 / 1251
» Randomness, Computability, and Density
Sort
View
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 10 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
VLSID
2007
IEEE
154views VLSI» more  VLSID 2007»
14 years 10 months ago
Model Based Test Generation for Microprocessor Architecture Validation
Functional validation of microprocessors is growing in complexity in current and future microprocessors. Traditionally, the different components (or validation collaterals) used i...
Sreekumar V. Kodakara, Deepak Mathaikutty, Ajit Di...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 10 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 10 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
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 10 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
« Prev « First page 1197 / 1251 Last » Next »