10608 search results - page 63 / 2122 » Complexity of O'Hara's Algorithm |
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
FOGA
2011
13 years 1 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
ECCV
2008
Springer
13 years 11 months ago
2008
Springer
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
CC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
FOCS
1990
IEEE
14 years 2 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.