185 search results - page 9 / 37 » Constructions of Grassmannian Simplices |
DCG
2000
14 years 10 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
CGI
2003
IEEE
15 years 3 months ago
2003
IEEE
Mesh simplification algorithms play an important role in computer graphics. In particular, view-dependent simplification methods are utilized widely to reduce the geometric comp...
IACR
2011
13 years 9 months ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
WSC
2007
15 years 13 days ago
2007
Planning construction projects typically makes use of the activity network based Critical Path Method (CPM), since it is very simple to use and reasonably versatile. Most other pl...
CEFP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language....