151 search results - page 15 / 31 » A Nonuniform Algorithm for the Hidden Number Problem in Subg... |
90
Voted
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...
145
Voted
SBACPAD
2003
IEEE
15 years 8 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
127
Voted
PDCN
2004
15 years 4 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
122
Voted
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
We consider the problem of image segmentation by clustering local histograms with parametric mixture-of-mixture models. These models represent each cluster by a single mixture mod...
159
Voted
STOC
1995
ACM
15 years 6 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....