Sciweavers

2436 search results - page 6 / 488
» Comonadic Notions of Computation
Sort
View
CSL
2007
Springer
14 years 1 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 7 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
CCA
2009
Springer
14 years 2 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
CCS
2009
ACM
13 years 5 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
3DPVT
2006
IEEE
139views Visualization» more  3DPVT 2006»
14 years 1 months ago
A Probabilistic Notion of Correspondence and the Epipolar Constraint
We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being rob...
Justin Domke, Yiannis Aloimonos