393 search results - page 29 / 79 » The LCA Problem Revisited |
101
click to vote
IWINAC
2005
Springer
15 years 7 months ago
2005
Springer
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
CPM
2003
Springer
15 years 7 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
130
click to vote
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
122
click to vote
DAM
2008
15 years 2 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
125
click to vote
SIAMSC
2008
15 years 1 months ago
2008
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...