Sciweavers

793 search results - page 91 / 159
» Efficient computation of the characteristic polynomial
Sort
View
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 11 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
ACCV
2010
Springer
13 years 3 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
ICCV
2009
IEEE
1425views Computer Vision» more  ICCV 2009»
14 years 11 months ago
Fast Ray Features for Learning Irregular Shapes
We introduce a new class of image features, the Ray feature set, that consider image characteristics at distant contour points, capturing information which is difficult to repre...
Kevin Smith, Alan Carleton, Vincent Lepetit
IJNSEC
2008
106views more  IJNSEC 2008»
13 years 8 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
ICASSP
2009
IEEE
13 years 6 months ago
Fast belief propagation process element for high-quality stereo estimation
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...