Sciweavers

739 search results - page 115 / 148
» Sorting Algorithms
Sort
View
AAAI
2008
15 years 1 months ago
Online Learning in Monkeys
We examine online learning in the context of the Wisconsin Card Sorting Task (WCST), a task for which the concept acquisition strategies for human and other primates are well docu...
Xiaojin Zhu, Michael Coen, Shelley Prudom, Ricki C...
CIKM
2008
Springer
15 years 1 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...
ISCAPDCS
2007
15 years 14 days ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 12 days ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
RECSYS
2010
ACM
14 years 11 months ago
Nantonac collaborative filtering: a model-based approach
A recommender system has to collect users' preference data. To collect such data, rating or scoring methods that use rating scales, such as good-fair-poor or a five-point-sca...
Toshihiro Kamishima, Shotaro Akaho