Sciweavers

1964 search results - page 132 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
NIPS
2008
13 years 9 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
EOR
2006
110views more  EOR 2006»
13 years 8 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
NA
2010
118views more  NA 2010»
13 years 6 months ago
Practical Quasi-Newton algorithms for singular nonlinear systems
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
Sandra Buhmiler, Natasa Krejic, Zorana Luzanin
ICB
2009
Springer
226views Biometrics» more  ICB 2009»
14 years 2 months ago
Accurate Palmprint Recognition Using Spatial Bags of Local Layered Descriptors
Abstract. State-of-the-art palmprint recognition algorithms achieve high accuracy based on component based texture analysis. However, they are still sensitive to local variations o...
Yufei Han, Tieniu Tan, Zhenan Sun
WINE
2007
Springer
124views Economy» more  WINE 2007»
14 years 2 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
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...
S. Muthukrishnan, Martin Pál, Zoya Svitkina