1554 search results - page 53 / 311 » Parameterized Complexity and Approximation Algorithms |
88
Voted
SODA
2012
ACM
13 years 21 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
CCCG
2010
14 years 11 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
84
Voted
IJAR
2010
14 years 8 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
169
click to vote
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
77
Voted
CISS
2010
IEEE
14 years 1 months ago
2010
IEEE
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...