656 search results - page 39 / 132 » Marrying Words and Trees |
104
click to vote
SIAMSC
2011
14 years 2 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
114
click to vote
GBRPR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
RSCTC
2000
Springer
15 years 3 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
125
click to vote
SI3D
1995
ACM
15 years 3 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...