Sciweavers

697 search results - page 24 / 140
» Learning a Hidden Hypergraph
Sort
View
FMSD
2008
110views more  FMSD 2008»
14 years 9 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
15 years 1 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
61
Voted
BMCBI
2008
170views more  BMCBI 2008»
14 years 9 months ago
Implementing EM and Viterbi algorithms for Hidden Markov Model in linear memory
Background: The Baum-Welch learning procedure for Hidden Markov Models (HMMs) provides a powerful tool for tailoring HMM topologies to data for use in knowledge discovery and clus...
Alexander G. Churbanov, Stephen Winters-Hilt
ECML
2005
Springer
15 years 3 months ago
Multi-view Discriminative Sequential Learning
Discriminative learning techniques for sequential data have proven to be more effective than generative models for named entity recognition, information extraction, and other task...
Ulf Brefeld, Christoph Büscher, Tobias Scheff...
ECML
2007
Springer
15 years 3 months ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani