424 search results - page 48 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
STOC
2010
ACM
14 years 14 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...