13603 search results - page 2451 / 2721 » On the Complexity of Computing Treelength |
202
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
201
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
181
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increa...
180
click to vote
ICN
2009
Springer
16 years 1 months ago
2009
Springer
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
191
click to vote
CF
2009
ACM
16 years 1 months ago
2009
ACM
As we reach the limits of single-core computing, we are promised more and more cores in our systems. Modern architectures include many performance counters per core, but few or no...