Sciweavers

234 search results - page 18 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
DAGSTUHL
1996
14 years 11 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook
CEC
2003
IEEE
15 years 1 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor
CASDMKM
2004
Springer
147views Data Mining» more  CASDMKM 2004»
15 years 3 months ago
Data Set Balancing
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
David L. Olson
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
ICANN
2010
Springer
14 years 8 months ago
Dynamic Shape Learning and Forgetting
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
Nikolaos Tsapanos, Anastasios Tefas, Ioannis Pitas