MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "The R*-Tree An Efficient and Robust Access Method for Points and Rectangles." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • E.G.M. Petrakis Indexing 2  
  • by unknown authors
  • … Beckmann, Hans-Peter Kriegel, “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles
  • Add To MetaCart
  • A Concentric Model for Community Mining in Graph Structures  
  • by Wei-Jun Zhou, Wen-jun Zhou, Ji-rong Wen, Ji-rong Wen, Wei-ying Ma, Wei-ying Ma, Hong-Jiang Zhang, Hong-jiang Zhang — 2002
  • … “The R*-tree: an efficient and robust access method for points and rectangles (by N. Beckmann et al…
  • Add To MetaCart
  • Bibliography  
  • by Aga Agarwal Geometric, The Dimacs Special Year, Pages American Mathematical Society, Aahps P. K. Agarwal, B. Aronov, Ahpsv P. K. Agarwal, S. Har-peled, S. Har-peled, M. Sharir
  • …. The R -tree: An efficient and robust access method for points and rectangles. In ACM SIGMOD Int. Conf…
  • Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB