1390 search results - page 224 / 278 » Computing the depth of a flat |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
121
click to vote
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
A fast collision detection and resolution scheme is one of the key components for interactive simulation of deformable objects. It is particularly challenging to reduce the computa...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
: Within the last few years, e-learning has become a focal point in several universities and organizations. While much research has been devoted to producing econtent, describing i...
109
click to vote
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
108
click to vote
VRCAI
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents real-time reconstruction of dynamic 3D avatar for interactive mixed reality. In computer graphics, one of the main goals is the combination of virtual scenes w...