882 search results - page 138 / 177 » Local Search for Very Large SAT Problems |
128
Voted
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
126
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
128
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
135
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such...
174
Voted
MM
2009
ACM
15 years 8 months ago
2009
ACM
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...