903 search results - page 90 / 181 » Non-well-founded trees in categories |
147
click to vote
VRCAI
2006
ACM
16 years 7 days ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
147
click to vote
INFOVIS
2005
IEEE
15 years 12 months ago
2005
IEEE
We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or “interleaving”, of more basic forms at diffe...
184
click to vote
NETGAMES
2005
ACM
15 years 12 months ago
2005
ACM
In this paper, we propose a new distributed event delivery method for MMORPG (Massively Multiplayer Online Role Playing Games). In our method, the whole game space is divided into...
171
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
164
click to vote
CLEF
2005
Springer
15 years 12 months ago
2005
Springer
This year we participated at 4 Question Answering tasks at CLEF: the Italian monolingual (I), Italian-English (I/E), Bulgarian monolingual (B), and Bulgarian-English (B/E) bilingu...