13603 search results - page 294 / 2721 » On the Complexity of Computing Treelength |
157
click to vote
FPL
2004
Springer
16 years 6 days ago
2004
Springer
Complex SoC and platform-based designs require integration of configurable IP cores from multiple sources. Even automatic compilation flows from a high-level description to HW/SW s...
188
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
199
click to vote
ICA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
187
click to vote
ICALP
2004
Springer
16 years 5 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
223
Voted
TIME
2003
IEEE
16 years 2 days ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...