2969 search results - page 1 / 594 » A space efficient algorithm for group structure computation |
MOC
1998
13 years 10 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
CPM
2007
Springer
14 years 3 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
ERSHOV
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
PVLDB
2010
13 years 6 months ago
2010
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
SIGMOD
2001
ACM
14 years 11 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...