Sciweavers

9659 search results - page 33 / 1932
» Points on Computable Curves
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
NA
2007
118views more  NA 2007»
13 years 9 months ago
Extrapolation methods for approximating arc length and surface area
A well-known method of estimating the length of a parametric curve in Rd is to sample some points from it and compute the length of the polygon passing through them. In this paper...
Michael S. Floater, Atgeirr F. Rasmussen, Ulrich R...
IWSEC
2010
Springer
13 years 7 months ago
Differential Addition in Generalized Edwards Coordinates
We use two parametrizations of points on elliptic curves in generalized Edwards form x2 + y2 = c2 (1 + dx2 y2 ) that omit the xcoordinate. The first parametrization leads to a diff...
Benjamin Justus, Daniel Loebenberger
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
14 years 1 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
ICCV
2001
IEEE
14 years 11 months ago
Hierarchical Pre-Segmentation without Prior Knowledge
A new method to pre-segment images by means of a hierarchical description is proposed. This description is obtained from an investigation of the deep structure of a scale space im...
Arjan Kuijper, Luc Florack