650 search results - page 46 / 130 » Generalized Self-Approaching Curves |
SDM
2012
SIAM
13 years 6 days ago
2012
SIAM
Outlier detection research is currently focusing on the development of new methods and on improving the computation time for these methods. Evaluation however is rather heuristic,...
ICAPR
2009
Springer
15 years 4 months ago
2009
Springer
We propose a novel energy term to make the curve evolution quite robust to spurious edges. The physical intuition behind the formulation is that an object edge is generally contin...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
MOC
1998
14 years 9 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...