2629 search results - page 453 / 526 » complex 2009 |
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...
ICSE
2009
IEEE-ACM
15 years 10 months ago
2009
IEEE-ACM
We present a new automated white box fuzzing technique and a tool, BuzzFuzz, that implements this technique. Unlike standard fuzzing techniques, which randomly change parts of the...
UM
2009
Springer
15 years 4 months ago
2009
Springer
Long term group work by small teams is a central part of many learning and workplace activities. Widespread group support tools such as wikis, version control systems and issue tra...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...