Sciweavers

6045 search results - page 1124 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
BIOINFORMATICS
2005
151views more  BIOINFORMATICS 2005»
13 years 7 months ago
Differential and trajectory methods for time course gene expression data
Motivation: The issue of high dimensionality in microarray data has been, and remains, a hot topic in statistical and computational analysis. Efficient gene filtering and differen...
Yulan Liang, Bamidele Tayo, Xueya Cai, Arpad Kelem...
IVC
2007
164views more  IVC 2007»
13 years 7 months ago
Locality preserving CCA with applications to data visualization and pose estimation
- Canonical correlation analysis (CCA) is a major linear subspace approach to dimensionality reduction and has been applied to image processing, pose estimation and other fields. H...
Tingkai Sun, Songcan Chen
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
COMPGEOM
2010
ACM
14 years 1 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
« Prev « First page 1124 / 1209 Last » Next »