1158 search results - page 138 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
234
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
208
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
201
click to vote
ICMLA
2008
15 years 7 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
176
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
173
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...