1021 search results - page 9 / 205 » Fast Approximate PCPs |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
ISPEC
2010
Springer
14 years 24 days ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...