Sciweavers

91 search results - page 8 / 19
» Models For Dependable Computation with Multiple Inputs and S...
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
FOCS
2009
IEEE
14 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
CCS
2009
ACM
14 years 8 months ago
A conceptual framework for Group-Centric secure information sharing
In this paper, we propose a conceptual framework for developing a family of models for Group-Centric information sharing. The traditional approach to information sharing, characte...
Ram Krishnan, Ravi S. Sandhu, Jianwei Niu, William...
TVLSI
2008
110views more  TVLSI 2008»
13 years 7 months ago
Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
Sanjukta Bhanja, Sudeep Sarkar