147 search results - page 12 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
111
click to vote
WOB
2004
15 years 1 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
179
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
ICCAD
2009
IEEE
14 years 9 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
DIS
2001
Springer
15 years 4 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
BMCBI
2006
14 years 11 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...