285 search results - page 53 / 57 » New Ways to Construct Binary Search Trees |
122
click to vote
SIGMOD
2000
ACM
15 years 4 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
117
Voted
ALENEX
2009
15 years 23 days ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
HASKELL
2008
ACM
15 years 22 days ago
2008
ACM
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
PR
2006
14 years 11 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...