782 search results - page 92 / 157 » MB-DPOP: A New Memory-Bounded Algorithm for Distributed Opti... |
139
click to vote
ADHOC
2006
15 years 2 months ago
2006
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
100
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
117
click to vote
NIPS
2008
15 years 3 months ago
2008
We formulate and study a new variant of the k-armed bandit problem, motivated by e-commerce applications. In our model, arms have (stochastic) lifetime after which they expire. In...
110
click to vote
CVPR
2001
IEEE
16 years 4 months ago
2001
IEEE
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...
121
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...