2520 search results - page 313 / 504 » The complexity of approximating entropy |
170
click to vote
CIS
2004
Springer
15 years 12 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
141
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
166
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
150
click to vote
ICA
2004
Springer
15 years 12 months ago
2004
Springer
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
160
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...