Sciweavers

7930 search results - page 1194 / 1586
» Greedy in Approximation Algorithms
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
COLING
2010
15 years 1 months ago
Multi-Document Summarization via the Minimum Dominating Set
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
Chao Shen, Tao Li
FOCM
2011
113views more  FOCM 2011»
15 years 1 months ago
Finite Resolution Dynamics
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
Stefano Luzzatto, Pawel Pilarczyk
JMLR
2010
125views more  JMLR 2010»
15 years 1 months ago
Continuous Time Bayesian Network Reasoning and Learning Engine
We present a continuous time Bayesian network reasoning and learning engine (CTBN-RLE). A continuous time Bayesian network (CTBN) provides a compact (factored) description of a co...
Christian R. Shelton, Yu Fan, William Lam, Joon Le...
JMLR
2010
108views more  JMLR 2010»
15 years 1 months ago
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
Taiji Suzuki, Masashi Sugiyama
« Prev « First page 1194 / 1586 Last » Next »