Sciweavers

1401 search results - page 111 / 281
» Randomness in Interactive Proofs
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
INFOCOM
2005
IEEE
15 years 3 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 10 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
ECCC
2010
122views more  ECCC 2010»
14 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah

Publication
222views
16 years 9 months ago
Quantitative Description of Spatially Homogeneous Textures by Characteristic Grey Level Co-Occurrences
Gibbs random eld model with multiple pairwise pixel interactions describes each type of spatially homogeneous image textures in terms of a pixel neighbourhood and Gibbs potentials...
Georgy Gimel'farb