1401 search results - page 174 / 281 » Randomness in Interactive Proofs |
FSS
2008
14 years 10 months ago
2008
Numerical possibility theory, belief function have been suggested as useful tools to represent imprecise, vague or incomplete information. They are particularly appropriate in unc...
TSMC
1998
14 years 9 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
TIST
2011
14 years 4 months ago
2011
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
CVPR
2012
IEEE
13 years 10 days ago
2012
IEEE
Scene text recognition has gained significant attention from the computer vision community in recent years. Recognizing such text is a challenging problem, even more so than the ...
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...