27 search results - page 1 / 6 » A Simple Algorithm for Stable Minimum Storage Merging |
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
BMVC
2010
13 years 2 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
EUSFLAT
2009
13 years 2 months ago
2009
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...