7522 search results - page 405 / 1505 » Spacing memetic algorithms |
292
click to vote
CPM
2009
Springer
15 years 5 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
239
click to vote
SIGMOD
2012
ACM
13 years 10 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
181
click to vote
RECOMB
2009
Springer
16 years 8 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
190
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
182
click to vote
ICCV
1999
IEEE
16 years 9 months ago
1999
IEEE
This paper examines the problem of reconstructing a voxelized representation of 3D space from a series of images. An iterative algorithm is used to find the scene model which join...