Sciweavers

2489 search results - page 5 / 498
» On the Subgroup Distance Problem
Sort
View
ML
2006
ACM
105views Machine Learning» more  ML 2006»
13 years 7 months ago
Propositionalization-based relational subgroup discovery with RSD
Abstract Relational rule learning algorithms are typically designed to construct classification and prediction rules. However, relational rule learning can be adapted also to subgr...
Filip Zelezný, Nada Lavrac
PAKDD
2005
ACM
103views Data Mining» more  PAKDD 2005»
14 years 25 days ago
Subgroup Discovery Techniques and Applications
This paper presents the advances in subgroup discovery and the ways to use subgroup discovery to generate actionable knowledge for decision support. Actionable knowledge is explici...
Nada Lavrac
IJAC
2010
122views more  IJAC 2010»
13 years 5 months ago
Automorphic orbits in Free Groups: Words versus Subgroups
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic or...
Pedro V. Silva, Pascal Weil
IJAC
2007
116views more  IJAC 2007»
13 years 7 months ago
On the Complexity of the Whitehead Minimization Problem
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...
Abdó Roig, Enric Ventura, Pascal Weil
PKC
2011
Springer
169views Cryptology» more  PKC 2011»
12 years 10 months ago
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
Jean-Sébastien Coron, Antoine Joux, Avradip...