2520 search results - page 222 / 504 » The complexity of approximating entropy |
150
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
152
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Equalization techniques for room impulse responses (RIRs) are important in acoustic signal processing applications such as speech dereverberation. In practice, only approximate es...
164
click to vote
ICMCS
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
183
click to vote
CISC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
190
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...