Sciweavers

2996 search results - page 470 / 600
» Numberings and Randomness
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
ICALP
2010
Springer
15 years 8 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
LATIN
2010
Springer
15 years 8 months ago
Lightweight Data Indexing and Compression in External Memory
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
Paolo Ferragina, Travis Gagie, Giovanni Manzini
CIBB
2008
15 years 8 months ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
MCS
2010
Springer
15 years 8 months ago
A Multi-Classifier System for Off-Line Signature Verification Based on Dissimilarity Representation
Abstract. Although widely used to reduce error rates of difficult pattern recognition problems, multiple classifier systems are not in widespread use in off-line signature verifica...
Luana Batista, Eric Granger, Robert Sabourin