2069 search results - page 151 / 414 » Linear time algorithms for Clobber |
194
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
195
click to vote
NIPS
2004
15 years 7 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
196
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
138
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
151
click to vote
ISCAS
2005
IEEE
16 years 2 days ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...