Sciweavers

989 search results - page 127 / 198
» Pebbling and Proofs of Work
Sort
View
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 2 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
SBMF
2009
Springer
156views Formal Methods» more  SBMF 2009»
14 years 2 months ago
Applying Event and Machine Decomposition to a Flash-Based Filestore in Event-B
Abstract. Event-B is a formal method used for specifying and reasoning about systems. Rodin is a toolset for developing system models in Event-B. Our experiment which is outlined i...
Kriangsak Damchoom, Michael J. Butler
EICS
2009
ACM
14 years 2 months ago
Interactive usability instrumentation
Usage data logged from user interactions can be extremely valuable for evaluating software usability. However, instrumenting software to collect usage data is a time-intensive tas...
Scott Bateman, Carl Gutwin, Nathaniel Osgood, Gord...
SOUPS
2009
ACM
14 years 2 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor