Rodrigo Paredes

Orcid: 0000-0002-9943-2510

According to our database1, Rodrigo Paredes authored at least 33 papers between 2002 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Boosting the Permutation Index for Similarity Searching Using an Eclectic Approach.
Proceedings of the Computer Science - CACIC 2022 - 28th Argentine Congress, 2022

2021
Power-Law Distributed Graph Generation With MapReduce.
IEEE Access, 2021

2020
R<sup>3</sup>MAT: A Rapid and Robust Graph Generator.
IEEE Access, 2020

2018
New Permutation Dissimilarity Measures for Proximity Searching.
Proceedings of the Similarity Search and Applications - 11th International Conference, 2018

2017
Improving the permutation-based proximity searching algorithm using zones and partial information.
Pattern Recognit. Lett., 2017

An empirical evaluation of intrinsic dimension estimators.
Inf. Syst., 2017

Fixed Height Queries Tree Permutation Index for Proximity Searching.
Proceedings of the Pattern Recognition - 9th Mexican Conference, 2017

2015
Dynamic Permutation Based Index for Proximity Searching.
Proceedings of the Similarity Search and Applications - 8th International Conference, 2015

Worst-case optimal incremental sorting.
Proceedings of the 34th International Conference of the Chilean Computer Science Society, 2015

Boosting the Permutation Based Index for Proximity Searching.
Proceedings of the Pattern Recognition - 7th Mexican Conference, 2015

2014
Metric Space Searching Based on Random Bisectors and Binary Fingerprints.
Proceedings of the Similarity Search and Applications - 7th International Conference, 2014

An Effective Permutant Selection Heuristic for Proximity Searching in Metric Spaces.
Proceedings of the Pattern Recognition - 6th Mexican Conference, 2014

Comparison of Methods to Assess Similarity between Phrases.
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2014

2013
List of Clustered Permutations for Proximity Searching.
Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

2012
Compact and Efficient Permutations for Proximity Searching.
Proceedings of the Pattern Recognition - 4th Mexican Conference, 2012

2011
Stronger Quickheaps.
Int. J. Found. Comput. Sci., 2011

Web-Based Refining of Machine Translations.
Proceedings of the 30th International Conference of the Chilean Computer Science Society, 2011

Efficient Group of Permutants for Proximity Searching.
Proceedings of the Pattern Recognition - Third Mexican Conference, 2011

Anomaly detection in power generation plants using similarity-based modeling and multivariate analysis.
Proceedings of the American Control Conference, 2011

2010
On Sorting, Heaps, and Minimum Spanning Trees.
Algorithmica, 2010

Enlarging nodes to improve dynamic spatial approximation trees.
Proceedings of the Third International Workshop on Similarity Search and Applications, 2010

2009
Speeding up spatial approximation search in metric spaces.
ACM J. Exp. Algorithmics, 2009

Solving similarity joins and range queries in metric spaces with the list of twin clusters.
J. Discrete Algorithms, 2009

Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph.
Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

2008
High-performance priority queues for parallel crawlers.
Proceedings of the 10th ACM International Workshop on Web Information and Data Management (WIDM 2008), 2008

List of twin clusters: a data structure for similarity joins in metric spaces.
Proceedings of the 24th International Conference on Data Engineering Workshops, 2008

2007
t-Spanners for metric space searching.
Data Knowl. Eng., 2007

2006
Practical Construction of <i>k</i>-Nearest Neighbor Graphs in Metric Spaces.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

On the Least Cost for Proximity Searching in Metric Spaces.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Optimal Incremental Sorting.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Using the <i>k</i>-Nearest Neighbor Graph for Proximity Searching in Metric Spaces.
Proceedings of the String Processing and Information Retrieval, 2005

2003
Practical Constraction of Metric t-Spanners.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
t-Spanners as a Data Structure for Metric Space Searching.
Proceedings of the String Processing and Information Retrieval, 2002


  Loading...