Sciweavers

335 search results - page 58 / 67
» Compact Proofs of Retrievability
Sort
View
JUCS
2008
140views more  JUCS 2008»
13 years 7 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
JMIV
2006
185views more  JMIV 2006»
13 years 7 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec
IACR
2011
158views more  IACR 2011»
12 years 7 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...
LATIN
2010
Springer
14 years 2 months ago
The Size and Depth of Layered Boolean Circuits
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
Anna Gál, Jing-Tang Jang
PLDI
2006
ACM
14 years 1 months ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka