2957 search results - page 402 / 592 » The Complexity of Polynomial-Time Approximation |
167
click to vote
DIALM
2004
ACM
15 years 12 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
179
click to vote
CAV
2004
Springer
15 years 12 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
140
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...