752 search results - page 126 / 151 » Faster approximation algorithms for the minimum latency prob... |
119
click to vote
WINE
2009
Springer
15 years 9 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
108
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
150
click to vote
ROBOCOMM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
122
click to vote
IMC
2003
ACM
15 years 8 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
112
click to vote
NIPS
1996
15 years 4 months ago
1996
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...