2899 search results - page 297 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
213
click to vote
ICCV
2011
IEEE
14 years 6 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...
206
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
156
click to vote
VTC
2006
IEEE
16 years 19 days ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
188
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
188
Voted
ITNG
2007
IEEE
16 years 26 days ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...