453 search results - page 50 / 91 » Tight bounds for the partial-sums problem |
107
Voted
IOR
2007
15 years 18 days ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
120
click to vote
ICDM
2009
IEEE
14 years 10 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
108
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
82
Voted
SAGT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
DAM
2008
15 years 23 days ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...