2333 search results - page 19 / 467 » Recursive Computational Depth |
308
click to vote
ECCC
2011
15 years 25 days ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
171
click to vote
FPL
2009
Springer
15 years 10 months ago
2009
Springer
Reconfigurable systems are widely used nowadays to increase performance of computationally intensive applications. There exist a lot of synthesis tools that automatically generate...
156
click to vote
AML
1998
15 years 5 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
148
click to vote
GBRPR
2009
Springer
15 years 10 months 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...
143
click to vote
ICPPW
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...