13603 search results - page 255 / 2721 » On the Complexity of Computing Treelength |
149
click to vote
SPIN
2005
Springer
15 years 11 months ago
2005
Springer
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
161
click to vote
DANCE
2002
IEEE
15 years 11 months ago
2002
IEEE
Active applications can add value to communication. Yet it involves sophisticated domain knowledge and complex development process. In this paper we discuss a framework for the co...
166
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
171
click to vote
IEEESCC
2010
IEEE
15 years 9 months ago
2010
IEEE
—As the amount of data generated by today’s pervasive environments increases exponentially, there is a stronger need to decipher the important information that is hidden among ...
140
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...