9659 search results - page 186 / 1932 » Points on Computable Curves |
184
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
180
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
139
click to vote
BMVC
2001
15 years 9 months ago
2001
We describe the development of a vision system to detect natural events in a low-resolution image stream. The work involves the assessment of algorithmic design decisions to maxim...
174
click to vote
MYCRYPT
2005
Springer
16 years 3 days ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
156
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...