2354 search results - page 211 / 471 » Randomness, Stochasticity and Approximations |
152
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
141
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
148
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
144
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
141
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...