<--- Back to Details
First PageDocument Content
Computer programming / Software engineering / Computing / Quadtree / B-tree / Knowledge representation / Tree / Linked list / Trie / Redblack tree / Binary tree
Date: 2008-08-29 23:31:44
Computer programming
Software engineering
Computing
Quadtree
B-tree
Knowledge representation
Tree
Linked list
Trie
Redblack tree
Binary tree

TREE STRUCTURES FOR REGION REPRESENTATION Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

Add to Reading List

Source URL: mapcontext.com

Download Document from Source Website

File Size: 548,94 KB

Share Document on Facebook

Similar Documents

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

DocID: 1uCBo - View Document

TREE STRUCTURES FOR REGION REPRESENTATION  Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

TREE STRUCTURES FOR REGION REPRESENTATION Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

DocID: 1rrxI - View Document

Programming Techniques S.L. Graham, R.L. Rivest Editors

Programming Techniques S.L. Graham, R.L. Rivest Editors

DocID: 1rm4m - View Document

Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c

Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c

DocID: 1riqj - View Document

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

DocID: 1r7j1 - View Document