Sciweavers

572 search results - page 49 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
14 years 9 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
14 years 11 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
GIS
2006
ACM
15 years 11 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
WINE
2009
Springer
147views Economy» more  WINE 2009»
15 years 2 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
PODS
2008
ACM
221views Database» more  PODS 2008»
15 years 10 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...