ANTS
2010
Springer
14 years 1 months ago
2010
Springer
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
ACISICIS
2009
IEEE
14 years 1 months ago
2009
IEEE
A PCNNs-based square-and-triangle-template method for binary fingerprint image thinning is proposed. The algorithm is iterative, in which a combined sequential and parallel proces...
AAIM
2010
Springer
14 years 1 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...