608 search results - page 27 / 122 » On Dependent Randomized Rounding Algorithms |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
ICALP
2001
Springer
14 years 2 days 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...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
AINA
2008
IEEE
13 years 9 months ago
2008
IEEE
BitTorrent is one of the most well known peer-topeer file sharing applications, accounting for a significant proportion of Internet traffic. Current BitTorrent system builds its o...
INFORMATICALT
2006
13 years 7 months ago
2006
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...