David Novak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
David Novak has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Pavel Zezula
Masaryk University
3 shared publications- Pavel Zezula
Masaryk University, Brno, Czech Republic
2 shared publications - Claudio Lucchese
Ca' Foscari University of Venice, Venice, Italy
1 shared publication - Fabrizio Falchi
ISTI-CNR
1 shared publication - Fausto Rabitti
Institute of Information Science and Technologies (ISTI) CNR Pisa Italy
1 shared publication Jan Cech
Czech Technical University
1 shared publication
Latest Publications
- 17 October 2015
- Published by Springer Nature
- p. 237-243
Efficient Image Search with Neural Net Features
- 17 October 2015
- Published by Springer Nature
- p. 237-243
Efficient Image Search with Neural Net Features
- 7 April 2015
- Published by Springer Nature
- p. 28-37
Multi-modal Similarity Retrieval with a Shared Distributed Data Store
- 7 April 2015
- Published by Springer Nature
- p. 28-37
Multi-modal Similarity Retrieval with a Shared Distributed Data Store
- 19 February 2015
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 20 (4) , 521-532
Multi-modal Similarity Retrieval with Distributed Key-value Store
- 19 February 2015
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 20 (4) , 521-532
Multi-modal Similarity Retrieval with Distributed Key-value Store
- 8 October 2013
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 57 (11) , 1741-1755
Performance Study of Independent Anchor Spaces for Similarity Searching
This work targets the problem of search efficiency vs. answer quality of approximate metric-based similarity search. We especially focus on techniques based on recursive Voronoi-like partitioning or, from another perspective, on pivot permutations. These techniques use sets of reference objects (anchors/pivots) to partition the metric space into cells of close data items. Instead of refining the search space by enlarging the anchor set of a single index, we propose to divide a large pivot set into several subsets and build multiple indexes with independent space partitioning; at query time, the overall search costs are also divided among the separate indexes. Our thorough experimental study on three different real datasets uncovers drawbacks of excessive increase of a single pivot set size—such partitioning refinement can be counterproductive beyond a certain number of pivots. Our approach overcomes the root causes of this limitation and increases the answer quality while preserving the search costs. Further, we address the question of robustness of the answer quality, which can be significantly improved by utilization of independent anchor spaces.
- 8 October 2013
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 57 (11) , 1741-1755
Performance Study of Independent Anchor Spaces for Similarity Searching
This work targets the problem of search efficiency vs. answer quality of approximate metric-based similarity search. We especially focus on techniques based on recursive Voronoi-like partitioning or, from another perspective, on pivot permutations. These techniques use sets of reference objects (anchors/pivots) to partition the metric space into cells of close data items. Instead of refining the search space by enlarging the anchor set of a single index, we propose to divide a large pivot set into several subsets and build multiple indexes with independent space partitioning; at query time, the overall search costs are also divided among the separate indexes. Our thorough experimental study on three different real datasets uncovers drawbacks of excessive increase of a single pivot set size—such partitioning refinement can be counterproductive beyond a certain number of pivots. Our approach overcomes the root causes of this limitation and increases the answer quality while preserving the search costs. Further, we address the question of robustness of the answer quality, which can be significantly improved by utilization of independent anchor spaces.
- 7 August 2009
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 47 (3) , 599-629
Building a web-scale image similarity search system
- 7 August 2009
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 47 (3) , 599-629
Building a web-scale image similarity search system