54 search results - page 4 / 11 » On Approximating the Entropy of Polynomial Mappings |
104
click to vote
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
PKC
2009
Springer
15 years 10 months ago
2009
Springer
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CC...
76
Voted
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
74
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
IWANN
2005
Springer
15 years 3 months ago
2005
Springer
Based on the Nystr¨om approximation and the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM), it becomes possible to apply a nonlinear model to a large sc...