5608 search results - page 968 / 1122 » On the Theory of Matchgate Computations |
120
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
122
click to vote
PLPV
2009
ACM
15 years 10 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
121
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
127
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
While the trust paradigm is essential to broadly extend the communication between the environment’s actors, the evaluation of trust becomes a challenge when confronted with init...
126
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...