108 search results - page 20 / 22 » On the computational complexity of partial covers of Theta g... |
ICALP
2007
Springer
14 years 8 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
DIALM
2005
ACM
13 years 8 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
WWW
2006
ACM
14 years 6 months ago
2006
ACM
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...
SAC
2010
ACM
13 years 6 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
102
click to vote
Publication
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...