10414 search results - page 140 / 2083 » An efficient algorithm for Co-segmentation |
164
click to vote
PODC
2000
ACM
15 years 10 months ago
2000
ACM
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
194
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
161
click to vote
ICISC
2004
15 years 7 months ago
2004
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
159
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
165
click to vote
IDEAL
2003
Springer
15 years 11 months ago
2003
Springer
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...