11 search results - page 1 / 3 » Optimal tree node ordering for child descendant navigations |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract— There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard c...
ALGORITHMICA
2005
13 years 4 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
CVPR
1998
IEEE
14 years 7 months ago
1998
IEEE
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...