1401 search results - page 92 / 281 » Randomness in Interactive Proofs |
108
click to vote
CPC
2010
14 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
108
click to vote
3DOR
2008
15 years 8 days ago
2008
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
172
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
EUROCRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...