2969 search results - page 40 / 594 » A space efficient algorithm for group structure computation |
MOC
1998
15 years 2 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
111
click to vote
DCC
2005
IEEE
16 years 2 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
116
click to vote
JMLR
2010
14 years 9 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
125
click to vote
CCCG
2010
15 years 4 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
106
click to vote
TPDS
2008
15 years 2 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...