Sciweavers

7811 search results - page 1236 / 1563
» computing 2004
Sort
View
150
Voted
EUROCRYPT
2009
Springer
16 years 5 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 5 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
KDD
2004
ACM
314views Data Mining» more  KDD 2004»
16 years 5 months ago
Assessment of discretization techniques for relevant pattern discovery from gene expression data
In the domain of gene expression data analysis, various researchers have recently emphasized the promising application of pattern discovery techniques like association rule mining...
Ruggero G. Pensa, Claire Leschi, Jéré...
139
Voted
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 5 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
157
Voted
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 5 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
« Prev « First page 1236 / 1563 Last » Next »