10988 search results - page 85 / 2198 » Algorithmic Folding Complexity |
102
click to vote
ADG
2004
Springer
15 years 7 months ago
2004
Springer
Construction of geometrical objects by origami, the Japanese traditional art of paper folding, is enjoyable and intriguing. It attracted the minds of artists, mathematicians and co...
116
click to vote
3DPVT
2002
IEEE
15 years 7 months ago
2002
IEEE
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
NSDI
2008
15 years 4 months ago
2008
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
114
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
105
click to vote
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...