1281 search results - page 190 / 257 » Transliteration as Constrained Optimization |
139
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
180
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
201
click to vote
GECCO
2009
Springer
16 years 15 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
164
click to vote
CISS
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
153
click to vote
INFOCOM
2008
IEEE
16 years 10 days ago
2008
IEEE
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...