1941 search results - page 232 / 389 » On the Hardness of Approximate Reasoning |
171
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
This paper describes SHAD, a novel architecture for security in pervasive computing environments, and a prototype implementation. SHAD is a Peer-to-Peer and humancentered security...
136
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
136
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
143
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Caches often employ write-back instead of writethrough, since write-back avoids unnecessary transfers for multiple writes to the same block. For several reasons, however...
140
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...