|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
July 1986 (vol. 35 no. 7)
pp. 651-653
| ASCII Text | x | ||
| V. Konard, "Efficient Computation of the Maximum of the Sum of Two Sequences and Applications," IEEE Transactions on Computers, vol. 35, no. 7, pp. 651-653, July, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1986.1676809, author = {V. Konard}, title = {Efficient Computation of the Maximum of the Sum of Two Sequences and Applications}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {7}, issn = {0018-9340}, year = {1986}, pages = {651-653}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676809}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Efficient Computation of the Maximum of the Sum of Two Sequences and Applications IS - 7 SN - 0018-9340 SP651 EP653 EPD - 651-653 A1 - V. Konard, PY - 1986 KW - ranking KW - Analysis of algorithms KW - average complexity KW - computational geometry KW - maximum norm KW - pattern classification VL - 35 JA - IEEE Transactions on Computers ER - | |||
Computing max{a1 + b1 , a2 + b2 , ... ,an + bn } trivially takes n additions. We show that if we are given the ranking for the a's and the b's separately, then an algorithm exists which will compute the maximum in ?2n additions on the average. This can be generalized to yield an efficient algorithm to compute max{h(a1 ,b1
Index Terms:
ranking, Analysis of algorithms, average complexity, computational geometry, maximum norm, pattern classification
Citation:
V. Konard, "Efficient Computation of the Maximum of the Sum of Two Sequences and Applications," IEEE Transactions on Computers, vol. 35, no. 7, pp. 651-653, July 1986, doi:10.1109/TC.1986.1676809
Usage of this product signifies your acceptance of the Terms of Use.