Sciweavers

1322 search results - page 151 / 265
» Parameterized counting problems
Sort
View
ICIP
2010
IEEE
13 years 8 months ago
Bayesian regularization of diffusion tensor images using hierarchical MCMC and loopy belief propagation
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
Siming Wei, Jing Hua, Jiajun Bu, Chun Chen, Yizhou...
JDA
2011
104views more  JDA 2011»
13 years 5 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
ICASSP
2011
IEEE
13 years 2 months ago
Parameter estimation using sparse reconstruction with dynamic dictionaries
We consider the problem of parameter estimation for signals characterized by sums of parameterized functions. We present a dynamic dictionary subset selection approach to paramete...
Christian D. Austin, Joshua N. Ash, Randolph L. Mo...
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 7 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
IWPEC
2009
Springer
14 years 4 months ago
Planar Capacitated Dominating Set Is W[1]-Hard
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penni...