14403 search results - page 33 / 2881 » Dynamical Systems Trees |
ICDM
2003
IEEE
14 years 3 months ago
2003
IEEE
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
NSDI
2010
13 years 11 months ago
2010
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
CSB
2005
IEEE
14 years 3 months ago
2005
IEEE
We present TreeRefiner, a tool for refining multiple alignments of biological sequences. Given a multiple alignment, a phylogenetic tree, and scoring parameters as input, TreeRefi...