Sciweavers

2253 search results - page 70 / 451
» Computing with Realizational Morphology
Sort
View
ISM
2006
IEEE
113views Multimedia» more  ISM 2006»
15 years 10 months ago
Individualization and Flexibility through Computer Algebra Systems in Virtual Laboratories
Virtual labs enable field specific experiments and open them for collaborative and distributed usage. In order to realize comprehensive laboratory set-ups providing a scientifi...
Sabina Jeschke, Thomas Richter
ASIACRYPT
2004
Springer
15 years 9 months ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
Berry Schoenmakers, Pim Tuyls
APAL
2007
88views more  APAL 2007»
15 years 4 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 4 months ago
On Ullman's theorem in computer vision
Both in the plane and in space, we invert the nonlinear Ullman transformation for 3 points and 3 orthographic cameras. While Ullman’s theorem assures a unique reconstruction mod...
Oliver Knill, Jose Ramirez-Herran
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 3 days ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...