2489 search results - page 2 / 498 » On the Subgroup Distance Problem |
BIOINFORMATICS
2007
13 years 6 months ago
2007
: Background Clustering algorithms are widely used in the analysis of microarray data. In clinical studies, they are often applied to find groups of co-regulated genes. Clustering...
CASCON
2007
13 years 7 months ago
2007
As online communities proliferate, methods are needed to explore and capture patterns of activity within them. This paper focuses on the problem of identifying active subgroups wi...
ISMIS
1999
Springer
13 years 10 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
QCQC
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...