325 search results - page 1 / 65 » Alternatives to two classic data structures |
SIGCSE
2005
ACM
13 years 10 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
FUN
2010
Springer
13 years 10 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
HPCA
1998
IEEE
13 years 9 months ago
1998
IEEE
The explosive growth in the performance of microprocessors and networks has created a new opportunity to reduce the latency of fine-grain communication. Microprocessor clock speed...
KDD
2010
ACM
13 years 7 months ago
2010
ACM
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...