Sciweavers

569 search results - page 29 / 114
» Dynamic Factor Graphs for Time Series Modeling
Sort
View
JMLR
2012
11 years 11 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 3 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 6 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
FOCS
2006
IEEE
14 years 2 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
BMCBI
2006
239views more  BMCBI 2006»
13 years 8 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...