151 search results - page 3 / 31 » A Nonuniform Algorithm for the Hidden Number Problem in Subg... |
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
ACISP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
IJAC
2007
13 years 7 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...