1080 search results - page 43 / 216 » Problem dependent optimization (PDO) |
161
click to vote
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
157
click to vote
AAAI
2007
15 years 6 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
162
click to vote
CISS
2007
IEEE
15 years 8 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
125
Voted
ASAP
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
136
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...