Sciweavers

205 search results - page 28 / 41
» Complexity of Polynomial Multiplication over Finite Fields
Sort
View
CSL
2008
Springer
13 years 9 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
ICDAR
2007
IEEE
14 years 1 months ago
Robust Document Warping with Interpolated Vector Fields
This paper describes a new versatile algorithm for correcting nonlinear distortions, such as curvature of book pages, in camera based document processing. We introduce the idea of...
D. Schneider, Marco Block, Raúl Rojas
IJCV
2000
149views more  IJCV 2000»
13 years 7 months ago
Recognition without Correspondence using Multidimensional Receptive Field Histograms
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...
Bernt Schiele, James L. Crowley
JUCS
2008
140views more  JUCS 2008»
13 years 7 months ago
Parallel Formulations of Scalar Multiplication on Koblitz Curves
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
Omran Ahmadi, Darrel Hankerson, Francisco Rodr&iac...
ECCV
2006
Springer
14 years 9 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...