3055 search results - page 10 / 611 » Randomized Search Trees |
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
DAGSTUHL
2007
13 years 9 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
WADS
1989
Springer
13 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...