Sciweavers

4047 search results - page 186 / 810
» The Discrete Basis Problem
Sort
View
122
Voted
CSJM
2008
126views more  CSJM 2008»
15 years 3 months ago
Private Key Extension of Polly Cracker Cryptosystems
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...
Nina Taslaman
138
Voted
APPML
2008
77views more  APPML 2008»
15 years 3 months ago
A controllability approach to shape identification
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...
Robert Azencott, Roland Glowinski, A. M. Ramos
ICPR
2008
IEEE
16 years 4 months ago
An adaptive-PCA algorithm for reflectance estimation from color images
This paper deals with the problem of spectral reflectance estimation from color camera outputs. Because the reconstruction of such functions is an inverse problem, stabilizing the...
Alamin Mansouri, Jon Yngve Hardeberg, Tadeusz Sliw...
119
Voted
STACS
2009
Springer
15 years 10 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
108
Voted
AUSAI
2005
Springer
15 years 9 months ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
Radim Belohlávek, Vilém Vychodil