409 search results - page 40 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
ACTA
1998
14 years 9 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
107
click to vote
PODS
2001
ACM
15 years 9 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
101
click to vote
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Many temporal processes can be naturally modeled as a stochastic system that evolves continuously over time. The representation language of continuous-time Bayesian networks allow...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...