Sciweavers

736 search results - page 58 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
CVPR
2008
IEEE
14 years 9 months ago
Fast and robust numerical solutions to minimal problems for cameras with radial distortion
A number of minimal problems of structure from motion for cameras with radial distortion have recently been studied and solved in some cases. These problems are known to be numeri...
Karl Åström, Klas Josephson, Martin Byr...
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
13 years 11 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
CAIP
2007
Springer
188views Image Analysis» more  CAIP 2007»
14 years 1 months ago
Curvature Estimation in Noisy Curves
An algorithm of estimation of the curvature at each point of a general discrete curve in O(nlog2 n) is proposed. It uses the notion of blurred segment, extending the definition of...
Thanh Phuong Nguyen, Isabelle Debled-Rennesson