2520 search results - page 81 / 504 » The complexity of approximating entropy |
156
click to vote
VLDB
1998
ACM
15 years 9 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
127
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
171
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
147
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
196
click to vote
DLOG
2009
15 years 3 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...