3657 search results - page 146 / 732 » A Study of Practical Deduplication |
CPAIOR
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
SUTC
2006
IEEE
14 years 4 months ago
2006
IEEE
To the best of our knowledge, there are only few security schemes for Adhoc networks [1]. In this study, we work on a practical security mechanism for Adhoc networks. To balance b...
WADS
2005
Springer
14 years 4 months ago
2005
Springer
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
CCS
2004
ACM
14 years 4 months ago
2004
ACM
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...