19320 search results - page 3749 / 3864 » On the complexity of computing determinants |
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...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
ARCS
2009
Springer
15 years 4 months ago
2009
Springer
The disparity between microprocessor clock frequencies and memory latency is a primary reason why many demanding applications run well below peak achievable performance. Software c...
112
click to vote
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...