Sciweavers

2069 search results - page 151 / 414
» Linear time algorithms for Clobber
Sort
View
164
Voted
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 8 months ago
Quadratic Goldreich-Levin Theorems
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...
Madhur Tulsiani, Julia Wolf
NIPS
2004
15 years 5 months ago
Two-Dimensional Linear Discriminant Analysis
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...
Jieping Ye, Ravi Janardan, Qi Li
161
Voted
BMCBI
2008
116views more  BMCBI 2008»
15 years 4 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
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...
Alvaro J. González, Li Liao
STACS
2009
Springer
15 years 11 months ago
Reverse Engineering Prefix Tables
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...
Julien Clément, Maxime Crochemore, Giuseppi...
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 10 months ago
Lower-bound estimation for multi-bitwidth scheduling
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...
Junjuan Xu, Jason Cong, Xu Cheng