2403 search results - page 187 / 481 » Optimal Randomized RANSAC |
192
click to vote
SC
2005
ACM
16 years 15 days ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
167
click to vote
SACRYPT
2004
Springer
16 years 9 days ago
2004
Springer
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
161
click to vote
CEC
2003
IEEE
16 years 7 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
185
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
292
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...