Login / Signup
K-D Trees Are Better when Cut on the Longest Side.
Matthew Dickerson
Christian A. Duncan
Michael T. Goodrich
Published in:
ESA (2000)
Keyphrases
</>
maximum number
image processing
database
decision making
learning algorithm
artificial intelligence
computer vision
decision trees
high quality
object recognition
preprocessing
upper bound
linear programming
normalized cut