3238 search results - page 199 / 648 » On the Computational Interpretation of Negation |
138
click to vote
VIZSEC
2004
Springer
15 years 12 months ago
2004
Springer
We present an approach to user re-authentication based on the data collected from the computer’s mouse device. Our underlying hypothesis is that one can successfully model user ...
191
click to vote
ARITH
2003
IEEE
15 years 12 months ago
2003
IEEE
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a r...
151
click to vote
ISHPC
2003
Springer
15 years 11 months ago
2003
Springer
Instruction issue consumes a large amount of energy in out of order processors, largely in the wakeup logic. Proposed solutions to the problem require prediction or additional hard...
153
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
144
click to vote
FCT
1999
Springer
15 years 11 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...