Sciweavers

6251 search results - page 1204 / 1251
» Randomness, Computability, and Density
Sort
View
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 4 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
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...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ASIACRYPT
2009
Springer
14 years 4 months ago
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi,...
EMSOFT
2009
Springer
14 years 4 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
ICIAR
2009
Springer
14 years 4 months ago
Implicit Active-Contouring with MRF
In this paper, we present a new image segmentation method based on energy minimization for iteratively evolving an implicit active contour. Methods for active contour evolution is ...
Pierre-Marc Jodoin, Venkatesh Saligrama, Janusz Ko...
NOSSDAV
2009
Springer
14 years 4 months ago
Overlay monitoring and repair in swarm-based peer-to-peer streaming
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
Nazanin Magharei, Reza Rejaie
« Prev « First page 1204 / 1251 Last » Next »