Sciweavers

88 search results - page 17 / 18
» cn 2004
Sort
View
CINQ
2004
Springer
133views Database» more  CINQ 2004»
13 years 9 months ago
Inductive Querying for Discovering Subgroups and Clusters
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...
Albrecht Zimmermann, Luc De Raedt
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 5 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
SAC
2004
ACM
13 years 11 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
AINA
2004
IEEE
13 years 9 months ago
Mobile IPv6 Extensions to support Nested Mobile Networks
Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should conside...
ZhiJun Gu, Dongmin Yang, Cheeha Kim
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
13 years 11 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...