Sciweavers

598 search results - page 29 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
BMCBI
2008
164views more  BMCBI 2008»
13 years 8 months ago
Word correlation matrices for protein sequence analysis and remote homology detection
Background: Classification of protein sequences is a central problem in computational biology. Currently, among computational methods discriminative kernel-based approaches provid...
Thomas Lingner, Peter Meinicke
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 8 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
SDM
2007
SIAM
176views Data Mining» more  SDM 2007»
13 years 10 months ago
Adaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Hichem Frigui, Cheul Hwang
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 8 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
BICOB
2010
Springer
13 years 6 months ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala