9659 search results - page 233 / 1932 » Points on Computable Curves |
166
click to vote
IJNSEC
2008
15 years 6 months ago
2008
The security issue has become an important concern of grid computing. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for us...
167
click to vote
CCCG
2003
15 years 8 months ago
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
188
click to vote
MOC
2002
15 years 6 months ago
2002
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
191
click to vote
MICCAI
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. This paper describes a novel approach to automatically recover accurate correspondence over various shapes. In order to detect the features points with the capability in ...
177
click to vote
SIAMSC
2008
15 years 6 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...