11211 search results - page 430 / 2243 » Data Structures |
145
click to vote
ML
2006
ACM
16 years 24 days ago
2006
ACM
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
191
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
305
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment j...
195
Voted
WIDM
2004
ACM
16 years 8 days ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
194
click to vote
TOG
2002
15 years 6 months ago
2002
Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, howeve...