Sciweavers

1164 search results - page 73 / 233
» Steerable Random Fields
Sort
View
ICDAR
2009
IEEE
15 years 19 days ago
Document Image Binarisation Using Markov Field Model
This paper presents a new approach for the binarization of seriously degraded manuscript. We introduce a new technique based on a Markov Random Field (MRF) model of the document. ...
Thibault Lelore, Frédéric Bouchara
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 7 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
CHES
2010
Springer
183views Cryptology» more  CHES 2010»
15 years 3 months ago
Coordinate Blinding over Large Prime Fields
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
Michael Tunstall, Marc Joye
FOCS
2004
IEEE
15 years 6 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
ICIP
2008
IEEE
16 years 4 months ago
Cooperative disparity and object boundary estimation
In this paper we carry out cooperatively both disparity and object boundary estimation by setting the two tasks in a unified Markovian framework. We introduce a new joint probabil...
Ramya Narasimha, Elise Arnaud, Florence Forbes, Ra...