Sciweavers

1369 search results - page 92 / 274
» Lattice computations for random numbers
Sort
View
IACR
2011
94views more  IACR 2011»
12 years 8 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,...
IMSCCS
2007
IEEE
14 years 3 months ago
Ensemble Subsurface Modeling Using Grid Computing Technology
Ensemble Kalman Filter (EnKF) uses a randomized ensemble of subsurface models for error and uncertainty estimation. However, the complexity of geological models and the requiremen...
Xin Li, Zhou Lei, Christopher D. White, Gabrielle ...
NPL
2007
109views more  NPL 2007»
13 years 8 months ago
Generative Modeling of Autonomous Robots and their Environments using Reservoir Computing
Autonomous mobile robots form an important research topic in the field of robotics due to their near-term applicability in the real world as domestic service robots. These robots ...
Eric A. Antonelo, Benjamin Schrauwen, Jan M. Van C...
COMPGEOM
2009
ACM
14 years 3 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
ISPDC
2007
IEEE
14 years 3 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat