13603 search results - page 426 / 2721 » On the Complexity of Computing Treelength |
197
click to vote
ALGORITHMICA
2004
15 years 7 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
194
click to vote
ICIP
2003
IEEE
16 years 9 months ago
2003
IEEE
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
206
click to vote
PERCOM
2008
ACM
16 years 7 months ago
2008
ACM
The complexity of developing and deploying context-aware pervasive-computing applications calls for distributed software infrastructures that assist applications to collect, aggre...
205
click to vote
MKM
2009
Springer
16 years 2 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
202
click to vote
SEMWEB
2009
Springer
16 years 2 months ago
2009
Springer
The usage of parallelization and distribution techniques in the field of ontology matching is of high interest for the semantic web community. This work presents an approach for ma...