6409 search results - page 406 / 1282 » A Computational Algorithm for Origami Design |
168
click to vote
IPSN
2007
Springer
16 years 28 days ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
163
click to vote
GLVLSI
2003
IEEE
16 years 2 days ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
149
click to vote
SCA
2007
15 years 9 months ago
2007
Recent efforts to visually capture the phenomena of boiling have proposed monolithic approaches that extend the basic techniques underlying existing fluid solvers. In this work, w...
182
click to vote
OPODIS
2010
15 years 4 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
183
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...