28888 search results - page 5559 / 5778 » Computability and complexity in analysis |
154
click to vote
ISORC
2009
IEEE
15 years 10 months ago
2009
IEEE
AUTOSAR as specified in its current version fosters timing-constraints at application level to support the development of real-time automotive applications. However, the standard...
121
Voted
ISORC
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed real-time automotive embedded systems have to be highly dependable as well as cost-efficient due to the large number of manufactured units. To close the gap between r...
116
Voted
APPROX
2009
Springer
15 years 10 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...
128
Voted
ASIACRYPT
2009
Springer
15 years 10 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...
134
click to vote
WABI
2009
Springer
15 years 10 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...