4926 search results - page 203 / 986 » Two Graph Algorithms On an Associative Computing Model |
131
click to vote
CAGD
2007
15 years 6 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
169
click to vote
ACMSE
2000
ACM
15 years 10 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
219
click to vote
ICPP
1996
IEEE
15 years 10 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
200
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
149
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...