2403 search results - page 296 / 481 » Optimal Randomized RANSAC |
173
click to vote
SACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
149
click to vote
DASFAA
2010
IEEE
15 years 11 months ago
2010
IEEE
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...
142
click to vote
ACSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
146
click to vote
CSCLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
164
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...