default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Pestov
Person information
- affiliation: University of Ottawa, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i21]Sushma Kumari, Vladimir G. Pestov:
Universal consistency of the k-NN rule in metric spaces and Nagata dimension. II. CoRR abs/2305.17282 (2023)- 2022
- [j12]Vladimir Pestov:
A universally consistent learning rule with a universally monotone error. J. Mach. Learn. Res. 23: 157:1-157:27 (2022) - 2021
- [i20]Vladimir Pestov:
A universally consistent learning rule with a universally monotone error. CoRR abs/2108.09733 (2021) - 2020
- [i19]Benoit Collins, Sushma Kumari, Vladimir G. Pestov:
Universal consistency of the k-NN rule in metric spaces and Nagata dimension. CoRR abs/2003.00894 (2020) - [i18]Vladimir G. Pestov:
A learning problem whose consistency is equivalent to the non-existence of real-valued measurable cardinals. CoRR abs/2005.01886 (2020)
2010 – 2019
- 2019
- [i17]Vladimir G. Pestov:
Elementos da teoria de aprendizagem de máquina supervisionada. CoRR abs/1910.06820 (2019) - 2014
- [j11]Gonzalo Navarro, Vladimir Pestov
:
Editorial. Inf. Syst. 45: 35-36 (2014) - 2013
- [j10]Vladimir Pestov:
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. Algorithmica 66(2): 310-328 (2013) - [j9]Vladimir Pestov:
Is the kk-NN classifier in high dimensions affected by the curse of dimensionality? Comput. Math. Appl. 65(10): 1427-1437 (2013) - [j8]Vladimir Pestov:
PAC learnability under non-atomic measures: A problem by Vidyasagar. Theor. Comput. Sci. 473: 29-45 (2013) - [c11]Hubert Haoyang Duan, Vladimir Pestov, Varun Singla:
Text Categorization via Similarity Search - An Efficient and Effective Novel Algorithm. SISAP 2013: 182-193 - [c10]Aleksandar Stojmirovic, Peter Andreae, Mike Boland, Thomas William Jordan, Vladimir Pestov:
PFMFind: A System for Discovery of Peptide Homology and Function. SISAP 2013: 319-324 - [i16]Hubert Haoyang Duan, Vladimir Pestov, Varun Singla:
Text Categorization via Similarity Search: An Efficient and Effective Novel Algorithm. CoRR abs/1307.2669 (2013) - 2012
- [j7]Vladimir Pestov:
Indexability, concentration, and VC theory. J. Discrete Algorithms 13: 2-18 (2012) - [e1]Gonzalo Navarro, Vladimir Pestov:
Similarity Search and Applications - 5th International Conference, SISAP 2012, Toronto, ON, Canada, August 9-10, 2012. Proceedings. Lecture Notes in Computer Science 7404, Springer 2012, ISBN 978-3-642-32152-8 [contents] - 2011
- [c9]Vladimir Pestov:
PAC learnability versus VC dimension: A footnote to a basic result of statistical learning. IJCNN 2011: 1141-1145 - [c8]Vladimir Pestov:
Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions. SISAP 2011: 25-32 - [i15]Vladimir Pestov:
PAC learnability versus VC dimension: a footnote to a basic result of statistical learning. CoRR abs/1104.2097 (2011) - 2010
- [j6]Vladimir Pestov:
Intrinsic dimensionality. ACM SIGSPATIAL Special 2(2): 8-11 (2010) - [c7]Vladimir Pestov:
PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar. ALT 2010: 134-147 - [c6]Vladimir Pestov:
Predictive PAC Learnability: A Paradigm for Learning from Exchangeable Input Data. GrC 2010: 387-391 - [c5]Vladimir Pestov:
A Note on Sample Complexity of Learning Binary Output Neural Networks under Fixed Input Distributions. SBRN 2010: 7-12 - [c4]Vladimir Pestov:
Indexability, concentration, and VC theory. SISAP 2010: 3-12 - [i14]Vladimir Pestov:
Predictive PAC learnability: a paradigm for learning from exchangeable input data. CoRR abs/1006.1129 (2010) - [i13]Vladimir Pestov:
PAC learnability of a concept class under non-atomic measures: a problem by Vidyasagar. CoRR abs/1006.5090 (2010) - [i12]Vladimir Pestov:
A note on sample complexity of learning binary output neural networks under fixed input distributions. CoRR abs/1007.1282 (2010) - [i11]Vladimir Pestov:
Intrinsic Dimensionality. CoRR abs/1007.5318 (2010) - [i10]Vladimir Pestov:
Indexability, concentration, and VC theory. CoRR abs/1008.5105 (2010)
2000 – 2009
- 2009
- [c3]Ilya Volnyansky, Vladimir Pestov:
Curse of Dimensionality in Pivot Based Indexes. SISAP 2009: 39-46 - [i9]Ilya Volnyansky, Vladimir Pestov:
Curse of Dimensionality in Pivot-based Indexes. CoRR abs/0906.0391 (2009) - 2008
- [j5]Vladimir Pestov:
Hyperlinear and Sofic Groups: A Brief Guide. Bull. Symb. Log. 14(4): 449-480 (2008) - [j4]Vladimir Pestov:
An axiomatic approach to intrinsic dimension of a dataset. Neural Networks 21(2-3): 204-213 (2008) - [i8]Vladimir Pestov:
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. CoRR abs/0812.0146 (2008) - 2007
- [j3]Aleksandar Stojmirovic, Vladimir Pestov:
Indexing schemes for similarity search in datasets of short protein fragments. Inf. Syst. 32(8): 1145-1165 (2007) - [c2]Vladimir Pestov:
Intrinsic dimension of a dataset: what properties does one expect? IJCNN 2007: 2959-2964 - [i7]Vladimir Pestov:
An axiomatic approach to intrinsic dimension of a dataset. CoRR abs/0712.2063 (2007) - [i6]Vladimir Pestov:
Intrinsic dimension of a dataset: what properties does one expect? CoRR abs/cs/0703125 (2007) - 2006
- [b1]Vladimir Pestov:
Dynamics of Infinite-dimensional Groups - The Ramsey-Dvoretzky-Milman Phenomenon. University lecture series 40, American Mathematical Society 2006, ISBN 978-0-8218-4137-2, pp. 1-192 - [j2]Vladimir Pestov, Aleksandar Stojmirovic:
Indexing Schemes for Similarity Search: an Illustrated Paradigm. Fundam. Informaticae 70(4): 367-385 (2006) - 2003
- [i5]Aleksandar Stojmirovic, Vladimir Pestov:
Indexing Schemes for Similarity Search In Datasets of Short Protein Fragments. CoRR cs.DS/0309005 (2003) - 2002
- [i4]Vladimir Pestov, Aleksandar Stojmirovic:
Indexing schemes for similarity search: an illustrated paradigm. CoRR cs.DS/0211018 (2002) - 2000
- [j1]Vladimir Pestov:
On the geometry of similarity search: Dimensionality curse and concentration of measure. Inf. Process. Lett. 73(1-2): 47-51 (2000)
1990 – 1999
- 1999
- [c1]Vladimir Pestov:
A Geometric Framework for Modelling Similarity Search. DEXA Workshop 1999: 150-154 - [i3]Markus Hegland, Vladimir Pestov:
Additive models in high dimensions. CoRR cs.DS/9912020 (1999) - [i2]Vladimir Pestov:
On the geometry of similarity search: dimensionality curse and concentration of measure. CoRR cs.IR/9901004 (1999) - [i1]Vladimir Pestov:
A geometric framework for modelling similarity search. CoRR cs.IR/9904002 (1999)
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 2025-01-09 13:10 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:
