512 search results - page 4 / 103 » Ranking interesting subgroups |
WWW
2007
ACM
14 years 8 months ago
2007
ACM
This paper reports a new general framework of focused web crawling based on "relational subgroup discovery". Predicates are used explicitly to represent the relevance cl...
DAGSTUHL
2004
13 years 8 months ago
2004
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
JSYML
2010
13 years 5 months ago
2010
Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
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...
PKC
2004
Springer
14 years 21 days ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...