1389 search results - page 97 / 278 » Lightweight dependent classes |
STACS
2009
Springer
15 years 6 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
106
click to vote
ANSS
2007
IEEE
15 years 5 months ago
2007
IEEE
— Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. The topological impairments ex...
SMI
2007
IEEE
15 years 5 months ago
2007
IEEE
As large shape repositories become more common, the problem of automatically generating good views of shapes has recently gained prominence. However, very few of the proposed meth...
RTA
2007
Springer
15 years 5 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...