2312 search results - page 180 / 463 » The complexity of estimating min-entropy |
137
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
162
click to vote
CISSE
2009
Springer
15 years 10 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
170
click to vote
NIPS
2001
15 years 8 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
189
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
146
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—With continuous technology scaling, soft errors are becoming an increasingly important design concern even for earth-bound applications. While compiler approaches have the poten...