6251 search results - page 1204 / 1251 » Randomness, Computability, and Density |
121
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...
134
click to vote
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
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...
132
click to vote
EMSOFT
2009
Springer
15 years 10 months ago
2009
Springer
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...
146
click to vote
ICIAR
2009
Springer
15 years 10 months ago
2009
Springer
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 ...
131
click to vote
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
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 ...