1389 search results - page 24 / 278 » Parallel Algorithms for Treewidth Two |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
AAAI
2008
13 years 10 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
FOIKS
2010
Springer
13 years 6 months ago
2010
Springer
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...
IPPS
2000
IEEE
14 years 26 days ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...