2137 search results - page 133 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
146
click to vote
EMMCVPR
1999
Springer
15 years 9 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
134
click to vote
SIAMCO
2002
15 years 4 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
175
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
133
Voted
APCSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
157
click to vote
AUSAI
2009
Springer
15 years 8 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...