170 search results - page 33 / 34 » On computational properties of chains of recurrences |
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
SP
2005
IEEE
14 years 27 days ago
2005
IEEE
In this paper, we propose BIND (Binding Instructions aNd Data),1 a fine-grained attestation service for securing distributed systems. Code attestation has recently received consi...
ICA3PP
2005
Springer
14 years 26 days ago
2005
Springer
In the present work we describe architectural concepts of the distributed molecular simulation package GridMD. The main purpose of this work is to underline the construction patter...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
AAAI
2006
13 years 8 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...