default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Mic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Vladimir Mic
, Pavel Zezula:
Filtering with relational similarity. Inf. Syst. 122: 102345 (2024)- [c17]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance. ICPRAM 2024: 499-510 - [c16]Marek Mahrík, Matús Sikyna, Vladimir Mic, Pavel Zezula:
Towards Personalized Similarity Search for Vector Databases. SISAP 2024: 126-139 - [c15]Eric Sadit Tellez, Martin Aumüller, Vladimir Mic:
Overview of the SISAP 2024 Indexing Challenge. SISAP 2024: 255-265 - 2023
- [c14]Vladimir Mic, Jan Sedmidubský, Pavel Zezula:
CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors. SISAP 2023: 300-308 - 2022
- [j3]Vladimir Mic, Pavel Zezula:
Data-dependent metric filtering. Inf. Syst. 108: 101980 (2022) - [c13]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Nearest-neighbor Search from Large Datasets using Narrow Sketches. ICPRAM 2022: 401-410 - [c12]Vladimir Mic, Pavel Zezula:
Concept of Relational Similarity Search. SISAP 2022: 89-103 - [c11]Markéta Krenková, Vladimir Mic, Pavel Zezula:
Similarity Search with the Distance Density Model. SISAP 2022: 118-132 - 2021
- [c10]Vladimir Mic, Tomás Racek, Ales Krenek, Pavel Zezula:
Similarity Search for an Extreme Application: Experience and Implementation. SISAP 2021: 265-279 - 2020
- [j2]Richard Connor, Alan Dearle, Vladimir Mic, Pavel Zezula:
On the application of convex transforms to metric search. Pattern Recognit. Lett. 138: 563-570 (2020) - [c9]Vladimir Mic, Pavel Zezula:
Accelerating Metric Filtering by Improving Bounds on Estimated Distances. SISAP 2020: 3-17 - [c8]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Pivot Selection for Narrow Sketches by Optimization Algorithms. SISAP 2020: 33-46
2010 – 2019
- 2019
- [j1]Vladimir Mic, David Novak, Pavel Zezula:
Binary Sketches for Secondary Filtering. ACM Trans. Inf. Syst. 37(1): 1:1-1:28 (2019) - [c7]Lucia Vadicamo, Vladimir Mic, Fabrizio Falchi, Pavel Zezula:
Metric Embedding into the Hamming Space with the n-Simplex Projection. SISAP 2019: 265-272 - 2018
- [c6]Vladimir Mic, David Novak, Lucia Vadicamo, Pavel Zezula:
Selecting Sketches for Similarity Search. ADBIS 2018: 127-141 - [c5]Vladimir Mic, David Novak, Pavel Zezula:
Modifying Hamming Spaces for Efficient Search. ICDM Workshops 2018: 945-953 - 2017
- [c4]Vladimir Mic, David Novak, Pavel Zezula:
Sketches with Unbalanced Bits for Similarity Search. SISAP 2017: 53-63 - 2016
- [c3]Vladimir Mic, David Novak, Pavel Zezula:
Designing Sketches for Similarity Filtering. ICDM Workshops 2016: 655-662 - [c2]Vladimir Mic, David Novak, Pavel Zezula:
Speeding up Similarity Search by Sketches. SISAP 2016: 250-258 - 2015
- [c1]Jan Sedmidubský, Vladimir Mic, Pavel Zezula:
Face Image Retrieval Revisited. SISAP 2015: 204-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
