Sciweavers

69 search results - page 3 / 14
» Equivalence of local treewidth and linear local treewidth an...
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 24 days ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 10 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
UAI
2008
13 years 8 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
AIPS
2006
13 years 8 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang