Sciweavers

6045 search results - page 114 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
GCC
2004
Springer
14 years 1 months ago
Distributed MD4 Password Hashing with Grid Computing Package BOINC
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...
Stephen Pellicer, Yi Pan, Minyi Guo
COMPGEOM
2009
ACM
14 years 2 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 2 months ago
Computation reuse for rigid-body dynamics
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
Anne Loomis, Devin J. Balkcom
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 1 months ago
Computing and Handling Cardinal Direction Information
Qualitative spatial reasoning forms an important part of the commonsense reasoning required for building intelligent Geographical Information Systems (GIS). Previous research has c...
Spiros Skiadopoulos, Christos Giannoukos, Panos Va...