1552 search results - page 288 / 311 » On the Complexity of Constant Propagation |
APPROX
2009
Springer
15 years 6 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...
127
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
100
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
IROS
2008
IEEE
15 years 6 months ago
2008
IEEE
— A biologically inspired azimuthal broadband sound localisation system is introduced to simulates the functional organisation of the human auditory midbrain up to the inferior c...