Sciweavers

1728 search results - page 162 / 346
» The Accelerated Euclidean Algorithm
Sort
View
ESANN
2008
15 years 4 months ago
Clustering of Self-Organizing Map
Abstract. In this paper, we present a new similarity measure for a clustering self-organizing map which will be reached using a new approach of hierarchical clustering. (1) The sim...
Hanane Azzag, Mustapha Lebbah
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 4 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 4 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 3 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 3 months ago
Symmetric Subresultants and Applications
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
Cyril Brunie, Philippe Saux Picart