Sciweavers

539 search results - page 73 / 108
» Linear complexity of transformed sequences
Sort
View
FGCS
2000
81views more  FGCS 2000»
14 years 9 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
PRL
2008
161views more  PRL 2008»
14 years 9 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
89
Voted
BMCBI
2006
120views more  BMCBI 2006»
14 years 9 months ago
An improved distance measure between the expression profiles linking co-expression and co-regulation in mouse
Background: Many statistical algorithms combine microarray expression data and genome sequence data to identify transcription factor binding motifs in the low eukaryotic genomes. ...
Ryung S. Kim, Hongkai Ji, Wing Hung Wong
CIE
2010
Springer
14 years 10 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 4 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng