34170 search results - page 6554 / 6834 » Optimization |
158
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
184
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
146
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
128
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
159
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...