2542 search results - page 98 / 509 » Computing Cartograms with Optimal Complexity |
156
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
140
click to vote
ICN
2007
Springer
15 years 9 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
143
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
125
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
118
click to vote
WABI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...