568 search results - page 77 / 114 » New bounds for the Cebysev functional |
133
click to vote
AI
2010
Springer
15 years 1 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
118
click to vote
TALG
2008
15 years 1 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
225
click to vote
CRYPTO
2000
Springer
15 years 4 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
ESA
2008
Springer
15 years 3 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
108
click to vote
CCS
2007
ACM
15 years 7 months ago
2007
ACM
We propose minimalist new hardware additions to a microprocessor chip that protect cryptographic keys in portable computing devices which are used in the field but owned by a cen...