306 search results - page 21 / 62 » Underspecified computation of normal forms |
CADE
2002
Springer
14 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
DSN
2003
IEEE
14 years 26 days ago
2003
IEEE
A masquerade attack, in which one user impersonates another, is among the most serious forms of computer abuse, largely because such attacks are often mounted by insiders, and can...
DLT
2006
13 years 9 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a new form of least squares (LS), called “hyperLS”, for geometric problems that frequently appear in computer vision applications. Doing rigorous error analysis, we...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...