2403 search results - page 226 / 481 » Optimal Randomized RANSAC |
242
click to vote
CRYPTO
2003
Springer
16 years 9 days ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
183
click to vote
PKC
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
197
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
233
click to vote
ICALP
1991
Springer
15 years 10 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
183
click to vote
AAAI
2008
15 years 9 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...