Sciweavers

381 search results - page 9 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
WSOM
2009
Springer
14 years 1 months ago
Career-Path Analysis Using Optimal Matching and Self-Organizing Maps
Abstract. This paper is devoted to the analysis of career paths and employability. The state-of-the-art on this topic is rather poor in methodologies. Some authors propose distance...
Sébastien Massoni, Madalina Olteanu, Patric...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 8 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
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
SOFSEM
2007
Springer
14 years 25 days ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
CGI
1998
IEEE
13 years 11 months ago
Hierarchical Decomposition of Datasets on Irregular Surface Meshes
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
Georges-Pierre Bonneau, Alexandre Gerussi