2312 search results - page 194 / 463 » The complexity of estimating min-entropy |
172
click to vote
CVPR
1996
IEEE
16 years 8 months ago
1996
IEEE
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
154
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
168
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
161
click to vote
DBPL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
152
click to vote
SACRYPT
2007
Springer
16 years 21 days ago
2007
Springer
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...