Sciweavers

1101 search results - page 14 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
INFOVIS
2005
IEEE
15 years 3 months ago
Importance-Driven Visualization Layouts for Large Time Series Data
Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in p...
Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobia...
BMCBI
2004
208views more  BMCBI 2004»
14 years 9 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
ICA
2007
Springer
15 years 1 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
ANOR
2002
57views more  ANOR 2002»
14 years 9 months ago
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
Siqun Wang, Monique Guignard
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 1 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos