Sciweavers

197 search results - page 23 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 1 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
14 years 7 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
A Markov blanket-based method for detecting causal SNPs in GWAS
Background: Detecting epistatic interactions associated with complex and common diseases can help to improve prevention, diagnosis and treatment of these diseases. With the develo...
Bing Han, Meeyoung Park, Xue-wen Chen
NDSS
2008
IEEE
14 years 1 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
DM
2000
150views more  DM 2000»
13 years 7 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West