10 search results - page 2 / 2 » cpm 2001 |
CPM
2001
Springer
13 years 10 months ago
2001
Springer
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
CPM
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
CCGRID
2001
IEEE
13 years 9 months ago
2001
IEEE
The Compute Power Market (CPM) is a market-based resource management and job scheduling system for grid computing on Internet-wide computational resources, particularly low-end pe...
CPM
2001
Springer
13 years 10 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
CPM
2004
Springer
13 years 11 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...