1058 search results - page 118 / 212 » It's Doomed; We Can Prove It |
CVPR
2008
IEEE
15 years 2 days ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
ALDT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
We put forward a new paradigm for building hybrid encryption schemes from constrained chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus authenticated symmet...