951 search results - page 12 / 191 » On the Computation of Correctly-Rounded Sums |
81
Voted
FCT
1991
Springer
15 years 1 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...
167
click to vote
ICGA
2006
16 years 10 months ago
2006
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
ICRA
2002
IEEE
15 years 3 months ago
2002
IEEE
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...