Sciweavers

234 search results - page 10 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
14 years 11 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
CVPR
2000
IEEE
15 years 11 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 4 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
ICC
2008
IEEE
168views Communications» more  ICC 2008»
15 years 4 months ago
A Balanced Tree-Based Strategy for Unstructured Media Distribution in P2P Networks
—Most research on P2P multimedia streaming assumes that users access video content sequentially and passively. Unlike P2P live streaming in which the peers start playback from th...
Changqiao Xu, Gabriel-Miro Muntean, Enda Fallon, A...