Sciweavers

6251 search results - page 1084 / 1251
» Randomness, Computability, and Density
Sort
View
CIKM
2008
Springer
15 years 6 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
150
Voted
CISC
2008
Springer
148views Cryptology» more  CISC 2008»
15 years 6 months ago
Publicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity ...
Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
15 years 6 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
142
Voted
MCS
2010
Springer
15 years 6 months ago
Multiple Classifier Systems under Attack
Abstract. In adversarial classification tasks like spam filtering, intrusion detection in computer networks and biometric authentication, a pattern recognition system must not only...
Battista Biggio, Giorgio Fumera, Fabio Roli
IDA
2010
Springer
15 years 5 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
« Prev « First page 1084 / 1251 Last » Next »