1647 search results - page 41 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
123
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
134
click to vote
DMSN
2004
ACM
15 years 7 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
167
Voted
APPROX
2000
Springer
15 years 6 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
117
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
139
Voted
SIGMETRICS
2008
ACM
15 years 2 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...