13603 search results - page 417 / 2721 » On the Complexity of Computing Treelength |
205
click to vote
GLOBAL
2003
Springer
16 years 25 days ago
2003
Springer
Abstract. Global computing applications co-ordinate distributed computations across widely-dispersed hosts. Such systems present formidable design and implementation challenges to ...
183
click to vote
ICLP
2003
Springer
16 years 25 days ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
192
click to vote
GBRPR
2009
Springer
16 years 7 days ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
208
click to vote
ICCAD
1999
IEEE
15 years 12 months ago
1999
IEEE
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
187
click to vote
IPPS
1997
IEEE
15 years 12 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...