184 search results - page 22 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
115
click to vote
DC
2008
14 years 11 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
ALMOB
2008
14 years 11 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...