13603 search results - page 351 / 2721 » On the Computational Complexity of Cut-Reduction |
167
click to vote
VRML
1997
ACM
15 years 11 months ago
1997
ACM
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
199
click to vote
CGI
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a new method of combining dynamic control of LOD and conservative occlusion culling based on a new hierarchical data structure of polygons. Our method is effec...
169
click to vote
CANS
2006
Springer
15 years 11 months ago
2006
Springer
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
175
click to vote
DLOG
2007
15 years 10 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
137
click to vote
CCCG
2007
15 years 9 months ago
2007
We analyze the computational complexity of various rolling cube puzzles.