Sciweavers

3055 search results - page 189 / 611
» Randomized Search Trees
Sort
View
JEA
2008
112views more  JEA 2008»
15 years 22 days ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
ICCV
2009
IEEE
14 years 10 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...
ICMCS
2006
IEEE
108views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Image Segmentation using Parallel Self Organizing Tree Map
At present, the researchers are making great effort to search for a general purpose resolution for image segmentation. Most of the approaches we are using now are somewhat ineffic...
Xiaoming Fan, Jonathan Randall, Ivan Lee
FOCS
1992
IEEE
15 years 4 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters