Sciweavers

285 search results - page 2 / 57
» New Ways to Construct Binary Search Trees
Sort
View
FOCS
2006
IEEE
13 years 10 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
CPC
2008
135views more  CPC 2008»
13 years 4 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
IUI
2009
ACM
14 years 1 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
13 years 4 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
IGARSS
2010
13 years 2 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...