2520 search results - page 66 / 504 » The complexity of approximating entropy |
IWPSE
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...
TAPIA
2005
ACM
15 years 3 months ago
2005
ACM
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...
102
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
ARITH
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...