Sciweavers

54 search results - page 4 / 11
» On Approximating the Entropy of Polynomial Mappings
Sort
View
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 14 days ago
Automatic generation of polynomial loop
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...
Enric Rodríguez-Carbonell, Deepak Kapur
PKC
2009
Springer
102views Cryptology» more  PKC 2009»
14 years 7 months ago
A Practical Key Recovery Attack on Basic TCHo
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...
Mathias Herrmann, Gregor Leander
MFCS
2005
Springer
14 years 18 days ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
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...
Fredrik Kuivinen
ICASSP
2011
IEEE
12 years 10 months ago
Sequential Monte Carlo method for parameter estimation in diffusion models of affinity-based biosensors
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...
Manohar Shamaiah, Xiaohu Shen, Haris Vikalo
IWANN
2005
Springer
14 years 18 days ago
Load Forecasting Using Fixed-Size Least Squares Support Vector Machines
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...
Marcelo Espinoza, Johan A. K. Suykens, Bart De Moo...