848 search results - page 32 / 170 » Randomness and the linear degrees of computability |
TGC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this survey paper we consider the class of protocols for informationhiding which use randomization to obfuscate the link between the observables and the information to...
157
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
COMPGEOM
1992
ACM
15 years 3 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...