Sciweavers

530 search results - page 90 / 106
» Universal randomized switching
Sort
View
TOCL
2008
113views more  TOCL 2008»
15 years 1 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich
100
Voted
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
14 years 11 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
155
Voted
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
13 years 9 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
CVPR
2009
IEEE
16 years 9 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 2 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao