Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/aist/EremeevKP16
%A Eremeev, Anton V.
%A Kel'manov, Alexander V.
%A Pyatkin, Artem V.
%B AIST
%D 2016
%E Ignatov, Dmitry I.
%E Khachay, Mikhail Yu.
%E Labunets, Valeri G.
%E Loukachevitch, Natalia V.
%E Nikolenko, Sergey I.
%E Panchenko, Alexander
%E Savchenko, Andrey V.
%E Vorontsov, Konstantin V.
%K dblp
%P 51-57
%T On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.
%U http://dblp.uni-trier.de/db/conf/aist/aist2016.html#EremeevKP16
%V 661
%@ 978-3-319-52919-6
@inproceedings{conf/aist/EremeevKP16,
added-at = {2019-09-16T00:00:00.000+0200},
author = {Eremeev, Anton V. and Kel'manov, Alexander V. and Pyatkin, Artem V.},
biburl = {https://www.bibsonomy.org/bibtex/2653c4a8981cf0d7e7c4643b84b5f09f9/dblp},
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 V.},
ee = {https://doi.org/10.1007/978-3-319-52920-2_5},
interhash = {9187e81bd8b8b2a9b604fa8d73e2d076},
intrahash = {653c4a8981cf0d7e7c4643b84b5f09f9},
isbn = {978-3-319-52919-6},
keywords = {dblp},
pages = {51-57},
series = {Communications in Computer and Information Science},
timestamp = {2024-04-10T00:26:39.000+0200},
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
}