6409 search results - page 726 / 1282 » A Computational Algorithm for Origami Design |
119
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
138
click to vote
REST
2010
ACM
15 years 10 months ago
2010
ACM
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
177
Voted
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
152
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
196
click to vote
FPL
2008
Springer
15 years 7 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...