161 search results - page 16 / 33 » Skewed Binary Search Trees |
CAIP
2009
Springer
13 years 12 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
IJCV
2008
13 years 8 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
AINA
2010
IEEE
14 years 1 months ago
2010
IEEE
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
DAGM
2005
Springer
14 years 2 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...