Sciweavers

212 search results - page 20 / 43
» Methods for Binary Multidimensional Scaling
Sort
View
WWW
2010
ACM
15 years 4 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
CIKM
2008
Springer
14 years 11 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...
CSDA
2006
82views more  CSDA 2006»
14 years 9 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
SIAMDM
2010
137views more  SIAMDM 2010»
14 years 8 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
PROCEDIA
2011
14 years 15 days ago
GPU-accelerated Chemical Similarity Assessment for Large Scale Databases
The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural info...
Marco Maggioni, Marco D. Santambrogio, Jie Liang