1059 search results - page 51 / 212 » Improved Algorithms via Approximations of Probability Distri... |
WINE
2007
Springer
15 years 3 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
IJCAI
2001
14 years 11 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
CISC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....