Sciweavers

99 search results - page 12 / 20
» Complexity of Langton's ant
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
FREAK: Fast Retina Keypoint
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
Alexandre Alahi, Raphael Ortiz, Pierre Vandergheyn...
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
13 years 11 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
13 years 11 months ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
ESANN
2008
13 years 8 months ago
Clustering of Self-Organizing Map
Abstract. In this paper, we present a new similarity measure for a clustering self-organizing map which will be reached using a new approach of hierarchical clustering. (1) The sim...
Hanane Azzag, Mustapha Lebbah