Sciweavers

392 search results - page 38 / 79
» Reversal Complexity Revisited
Sort
View
WSCG
2003
185views more  WSCG 2003»
13 years 9 months ago
Complex 3D Feature Registration Using a Marching Template
The registration of 3D form features is essential to the supporting of reverse shape design processes. Extracting an editable shape feature from unordered data points is notorious...
Joris S. M. Vergeest, Sander Spanjaard, Chensheng ...

Publication
295views
12 years 5 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
STACS
2009
Springer
14 years 2 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
CLUSTER
2001
IEEE
13 years 11 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert