5350 search results - page 318 / 1070 » Space and time in eco-ontologies |
181
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
178
click to vote
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
15 years 8 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
202
click to vote
CCCG
2003
15 years 8 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
160
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
157
click to vote
IJCAI
2003
15 years 8 months ago
2003
Symmetry breaking in CSPs has attracted consid erable attention in recent years. Various general schemes have been proposed to eliminate sym metries during search. In general,...