9659 search results - page 175 / 1932 » Points on Computable Curves |
156
click to vote
CRYPTO
2004
Springer
16 years 10 hour ago
2004
Springer
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
182
click to vote
CAGD
1999
15 years 6 months ago
1999
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
179
click to vote
ISITA
2010
15 years 1 months ago
2010
We consider the Binary Erasure Source (BES) introduced by Martinian and Yedidia. Based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion p...
177
click to vote
COMPGEOM
1994
ACM
15 years 10 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...
157
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
We consider how tracking in stereo may be enhanced by coupling pairs of active contours in different views via affine epipolar geometry and various subsets of planar affine transf...