14548 search results - page 326 / 2910 » The Optimal Path-Matching Problem |
265
click to vote
ICDCS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
172
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
157
click to vote
PR
2010
15 years 5 months ago
2010
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
180
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
196
click to vote
PAMI
2010
15 years 5 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...