409 search results - page 57 / 82 » Iterative methods for computing generalized inverses |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
IMR
2003
Springer
14 years 24 days ago
2003
Springer
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
ICVS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...