Sciweavers

3143 search results - page 40 / 629
» Minimization of entropy functionals
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
14 years 11 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
MP
2011
14 years 6 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
EUROCRYPT
2000
Springer
15 years 3 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
DSD
2009
IEEE
71views Hardware» more  DSD 2009»
15 years 3 months ago
Representation of Incompletely Specified Index Generation Functions Using Minimal Number of Compound Variables
This paper shows a method to reduce the number of input variables to represent incompletely specified index generation functions. A compound variable is generated by EXORing the o...
Tsutomu Sasao, Takaaki Nakamura, Munehiro Matsuura
CVPR
1999
IEEE
16 years 1 months ago
Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function
Charles V. Stewart, Kishore Bubna, A. G. Amitha Pe...