1403 search results - page 87 / 281 » About Approximations of Exponentials |
134
click to vote
CEC
2011
IEEE
14 years 24 days ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
96
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
105
click to vote
ARITH
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
116
Voted
SIGECOM
2008
ACM
15 years 22 days ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
130
Voted
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...