On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. Eremeev, A. V., Kel'manov, A. V., & Pyatkin, A. V. In Ignatov, D. I., Khachay, M. Y., Labunets, V. G., Loukachevitch, N. V., Nikolenko, S. I., Panchenko, A., Savchenko, A. V., & Vorontsov, K., editors, *AIST*, volume 661, of *Communications in Computer and Information Science*, pages 51-57, 2016. Link Paper bibtex @inproceedings{conf/aist/EremeevKP16,
author = {Eremeev, Anton V. and Kel'manov, Alexander V. and Pyatkin, Artem V.},
booktitle = {AIST},
crossref = {conf/aist/2016},
editor = {Ignatov, Dmitry I. and Khachay, Mikhail Yu. and Labunets, Valeri G. and Loukachevitch, Natalia V. and Nikolenko, Sergey I. and Panchenko, Alexander and Savchenko, Andrey V. and Vorontsov, Konstantin},
ee = {http://dx.doi.org/10.1007/978-3-319-52920-2_5},
interhash = {9187e81bd8b8b2a9b604fa8d73e2d076},
intrahash = {c4dc9bd6033e3630a839bfaad83c368c},
isbn = {978-3-319-52919-6},
pages = {51-57},
series = {Communications in Computer and Information Science},
title = {On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.},
url = {http://dblp.uni-trier.de/db/conf/aist/aist2016.html#EremeevKP16},
volume = 661,
year = 2016
}

Downloads: 0

{"_id":"5imctPDfJLo7PMmAk","bibbaseid":"eremeev-kelmanov-pyatkin-oncomplexityofsearchingasubsetofvectorswithshortestaverageunderacardinalityrestriction-2016","downloads":0,"creationDate":"2017-11-25T00:20:57.307Z","title":"On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.","author_short":["Eremeev, A. V.","Kel'manov, A. V.","Pyatkin, A. V."],"year":2016,"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/artem?items=1000","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Eremeev"],"firstnames":["Anton","V."],"suffixes":[]},{"propositions":[],"lastnames":["Kel'manov"],"firstnames":["Alexander","V."],"suffixes":[]},{"propositions":[],"lastnames":["Pyatkin"],"firstnames":["Artem","V."],"suffixes":[]}],"booktitle":"AIST","crossref":"conf/aist/2016","editor":[{"propositions":[],"lastnames":["Ignatov"],"firstnames":["Dmitry","I."],"suffixes":[]},{"propositions":[],"lastnames":["Khachay"],"firstnames":["Mikhail","Yu."],"suffixes":[]},{"propositions":[],"lastnames":["Labunets"],"firstnames":["Valeri","G."],"suffixes":[]},{"propositions":[],"lastnames":["Loukachevitch"],"firstnames":["Natalia","V."],"suffixes":[]},{"propositions":[],"lastnames":["Nikolenko"],"firstnames":["Sergey","I."],"suffixes":[]},{"propositions":[],"lastnames":["Panchenko"],"firstnames":["Alexander"],"suffixes":[]},{"propositions":[],"lastnames":["Savchenko"],"firstnames":["Andrey","V."],"suffixes":[]},{"propositions":[],"lastnames":["Vorontsov"],"firstnames":["Konstantin"],"suffixes":[]}],"ee":"http://dx.doi.org/10.1007/978-3-319-52920-2_5","interhash":"9187e81bd8b8b2a9b604fa8d73e2d076","intrahash":"c4dc9bd6033e3630a839bfaad83c368c","isbn":"978-3-319-52919-6","pages":"51-57","series":"Communications in Computer and Information Science","title":"On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.","url":"http://dblp.uni-trier.de/db/conf/aist/aist2016.html#EremeevKP16","volume":"661","year":"2016","bibtex":"@inproceedings{conf/aist/EremeevKP16,\n author = {Eremeev, Anton V. and Kel'manov, Alexander V. and Pyatkin, Artem V.},\n booktitle = {AIST},\n crossref = {conf/aist/2016},\n editor = {Ignatov, Dmitry I. and Khachay, Mikhail Yu. and Labunets, Valeri G. and Loukachevitch, Natalia V. and Nikolenko, Sergey I. and Panchenko, Alexander and Savchenko, Andrey V. and Vorontsov, Konstantin},\n ee = {http://dx.doi.org/10.1007/978-3-319-52920-2_5},\n interhash = {9187e81bd8b8b2a9b604fa8d73e2d076},\n intrahash = {c4dc9bd6033e3630a839bfaad83c368c},\n isbn = {978-3-319-52919-6},\n pages = {51-57},\n series = {Communications in Computer and Information Science},\n title = {On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.},\n url = {http://dblp.uni-trier.de/db/conf/aist/aist2016.html#EremeevKP16},\n volume = 661,\n year = 2016\n}\n\n","author_short":["Eremeev, A. V.","Kel'manov, A. V.","Pyatkin, A. V."],"editor_short":["Ignatov, D. I.","Khachay, M. Y.","Labunets, V. G.","Loukachevitch, N. V.","Nikolenko, S. I.","Panchenko, A.","Savchenko, A. V.","Vorontsov, K."],"key":"conf/aist/EremeevKP16","id":"conf/aist/EremeevKP16","bibbaseid":"eremeev-kelmanov-pyatkin-oncomplexityofsearchingasubsetofvectorswithshortestaverageunderacardinalityrestriction-2016","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/978-3-319-52920-2_5","Paper":"http://dblp.uni-trier.de/db/conf/aist/aist2016.html#EremeevKP16"},"downloads":0},"search_terms":["complexity","searching","subset","vectors","shortest","average","under","cardinality","restriction","eremeev","kel'manov","pyatkin"],"keywords":[],"authorIDs":[],"dataSources":["7supHakfuKN3wzsvy"]}