Sciweavers

2869 search results - page 362 / 574
» Metropolis-Hastings algorithms with adaptive proposals
Sort
View
WWW
2008
ACM
16 years 7 months ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 8 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
ICML
2009
IEEE
16 years 7 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
KDD
2002
ACM
110views Data Mining» more  KDD 2002»
16 years 7 months ago
A model for discovering customer value for E-content
There exists a huge demand for multimedia goods and services in the Internet. Currently available bandwidth speeds can support sale of downloadable content like CDs, e-books, etc....
Srinivasan Jagannathan, Jayanth Nayak, Kevin C. Al...
PPOPP
2010
ACM
16 years 3 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...