default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlejandro Flores-Velazco
Person information
- affiliation: Simón Bolívar University, Caracas, Venezuela
Other persons with the same name
- Alejandro Flores — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Alejandro Flores-Velazco:
Algorithms and Data Structures for Faster Nearest-Neighbor Classification. University of Maryland, College Park, MD, USA, 2022
Journal Articles
- 2021
- [j1]Alejandro Flores-Velazco
, David M. Mount:
Guarantees on nearest-neighbor condensation heuristics. Comput. Geom. 95: 101732 (2021)
Conference and Workshop Papers
- 2022
- [c11]Alejandro Flores-Velazco:
Improved Search of Relevant Points for Nearest-Neighbor Classification. ESA 2022: 54:1-54:10 - 2021
- [c10]Alejandro Flores-Velazco, David M. Mount:
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ESA 2021: 44:1-44:15 - 2020
- [c9]Alejandro Flores-Velazco:
Social Distancing is Good for Points too! CCCG 2020: 352-358 - [c8]Alejandro Flores-Velazco, David M. Mount:
Coresets for the Nearest-Neighbor Rule. ESA 2020: 47:1-47:19 - 2019
- [c7]Alejandro Flores-Velazco, David M. Mount:
Guarantees on Nearest-Neighbor Condensation heuristics. CCCG 2019: 87-93 - 2016
- [c6]Ignacio Traverso Ribón, Guillermo Palma, Alejandro Flores, Maria-Esther Vidal:
Considering Semantics on the Discovery of Relations in Knowledge Graphs. EKAW 2016: 666-680 - 2015
- [c5]Alejandro Flores, Maria-Esther Vidal, Guillermo Palma:
Exploiting Semantics to Predict Potential Novel Links from Dense Subgraphs. AMW 2015 - [c4]Casey Lynnette Overby, Alejandro Flores, Guillermo Palma, Maria-Esther Vidal, Elena Zotkina, Louiqa Raschid:
Combining Multiple Knowledge Sources: A Case Study of Drug Induced Liver Injury. DILS 2015: 3-12 - 2014
- [c3]Alejandro Flores, Maria-Esther Vidal, Guillermo Palma:
Graphium Chrysalis: Exploiting Graph Database Engines to Analyze RDF Graphs. ESWC (Satellite Events) 2014: 326-331 - 2013
- [c2]Domingo De Abreu, Alejandro Flores, Guillermo Palma, Valeria Pestana, José Piñero, Jonathan Queipo, José Sánchez, Maria-Esther Vidal:
Choosing Between Graph Databases and RDF Engines for Consuming and Mining Linked Data. COLD 2013 - [c1]Alejandro Flores, Guillermo Palma, Maria-Esther Vidal, Domingo De Abreu, Valeria Pestana, José Piñero, Jonathan Queipo, José Sánchez:
GRAPHIUM: Visualizing Performance of Graph and RDF Engines on Linked Data. ISWC (Posters & Demos) 2013: 133-136
Informal and Other Publications
- 2022
- [i4]Alejandro Flores-Velazco:
Improved Search of Relevant Points for Nearest-Neighbor Classification. CoRR abs/2203.03567 (2022) - 2020
- [i3]Alejandro Flores-Velazco, David M. Mount:
Coresets for the Nearest-Neighbor Rule. CoRR abs/2002.06650 (2020) - [i2]Alejandro Flores-Velazco:
Social Distancing is Good for Points too! CoRR abs/2006.15650 (2020) - 2019
- [i1]Alejandro Flores-Velazco, David M. Mount:
Guarantees on Nearest-Neighbor Condensation heuristics. CoRR abs/1904.12142 (2019)
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-04-25 05:46 CEST 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:
