Sciweavers

61 search results - page 2 / 13
» Performance analysis of niching algorithms based on derandom...
Sort
View
IR
2002
13 years 5 months ago
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...
BMCBI
2011
12 years 9 months ago
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 6 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...
TSP
2010
13 years 1 hour ago
Algorithms for Complex ML ICA and Their Stability Analysis Using Wirtinger Calculus
Abstract--We derive a class of algorithms for independent component analysis (ICA) based on maximum likelihood (ML) estimation and perform stability analysis of natural gradient ML...
Hualiang Li, Tülay Adali
JACM
2006
98views more  JACM 2006»
13 years 5 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson