Sciweavers

1064 search results - page 84 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ICASSP
2008
IEEE
15 years 10 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
CSL
2009
Springer
15 years 10 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
ICASSP
2008
IEEE
15 years 10 months ago
Nested support vector machines
The one-class and cost-sensitive support vector machines (SVMs) are state-of-the-art machine learning methods for estimating density level sets and solving weighted classificatio...
Gyemin Lee, Clayton Scott
JMLR
2010
115views more  JMLR 2010»
14 years 11 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...