285 search results - page 25 / 57 » New Ways to Construct Binary Search Trees |
107
click to vote
ML
2010
ACM
14 years 10 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
103
click to vote
CEC
2010
IEEE
15 years 26 days ago
2010
IEEE
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
TCS
2008
14 years 11 months ago
2008
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
SIGCSE
2012
ACM
13 years 7 months ago
2012
ACM
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
190
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...