13603 search results - page 2615 / 2721 » On the Complexity of Computing Treelength |
185
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
208
click to vote
ISORC
2009
IEEE
16 years 1 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...
160
click to vote
ISORC
2009
IEEE
16 years 1 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...
162
click to vote
APPROX
2009
Springer
16 years 1 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...
163
click to vote
ASIACRYPT
2009
Springer
16 years 1 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...