1058 search results - page 8 / 212 » It's Doomed; We Can Prove It |
COMMA
2008
13 years 11 months ago
2008
Abstract. We present a variant of AB-dispute derivations for assumption-based argumentation (ABA), that can be used for determining the admissibility of claims. ABA reduces the pro...
ALGORITHMICA
2000
13 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
NIPS
2003
13 years 11 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...