92 search results - page 11 / 19 » Generating Shorter Bases for Hard Random Lattices |
104
click to vote
ISSTA
2006
ACM
15 years 5 months ago
2006
ACM
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
78
Voted
ECCC
2010
14 years 11 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
98
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
108
click to vote
KDD
2006
ACM
16 years 4 days ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...