Sciweavers

5105 search results - page 194 / 1021
» An algorithm to determine peer-reviewers
Sort
View
SAC
2004
ACM
15 years 12 months ago
Guiding motif discovery by iterative pattern refinement
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
Zhiping Wang, Mehmet M. Dalkilic, Sun Kim
ACCV
2007
Springer
16 years 22 days ago
Texture-Independent Feature-Point Matching (TIFM) from Motion Coherence
Abstract. This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of th...
Ping Li, Dirk Farin, Rene Klein Gunnewiek, Peter H...
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
15 years 12 months ago
Stable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
Pok-Son Kim, Arne Kutzner
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
15 years 12 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti