1554 search results - page 66 / 311 » Parameterized Complexity and Approximation Algorithms |
162
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
137
Voted
CMSB
2008
Springer
15 years 4 months ago
2008
Springer
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
128
click to vote
ECRTS
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
164
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
117
click to vote
JMM2
2007
15 years 2 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...