562 search results - page 40 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
EOR
2007
14 years 9 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
105
click to vote
ACSAC
2010
IEEE
14 years 1 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...