Sciweavers

417 search results - page 23 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
CF
2007
ACM
15 years 1 months ago
Fast compiler optimisation evaluation using code-feature based performance prediction
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
Christophe Dubach, John Cavazos, Björn Franke...
ECCV
2000
Springer
15 years 11 months ago
3-D Motion and Structure from 2-D Motion Causally Integrated over Time: Implementation
The causal estimation of three-dimensional motion from a sequence of two-dimensional images can be posed as a nonlinear filtering problem. We describe the implementation of an algo...
Alessandro Chiuso, Paolo Favaro, Hailin Jin, Stefa...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
COCOA
2008
Springer
14 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
15 years 2 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig