Sciweavers

136 search results - page 13 / 28
» On the generation of multivariate polynomials which are hard...
Sort
View
IACR
2011
125views more  IACR 2011»
12 years 7 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
SAC
2010
ACM
14 years 2 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
13 years 7 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho
FOCS
2000
IEEE
13 years 12 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
MIR
2006
ACM
157views Multimedia» more  MIR 2006»
14 years 1 months ago
Generating summaries and visualization for large collections of geo-referenced photographs
We describe a framework for automatically selecting a summary set of photos from a large collection of geo-referenced photographs. Such large collections are inherently difficult ...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...