1421 search results - page 92 / 285 » Algorithms for subsequence combinatorics |
140
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
133
click to vote
FCT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
141
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
141
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
We propose a fast text/graphics resolution improvement algorithm with boundary parameterization and wavelet based denoising. Given input images containing labeled text/graphics ob...
152
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Mixed Multi-Unit Combinatorial Auctions extend and generalise all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical ap...