Gilberto Gutiérrez

Orcid: 0000-0001-6059-1453

Affiliations:
  • University of the Bío Bío, Department of Computer Science and Information Technology, Chillán, Chile


According to our database1, Gilberto Gutiérrez authored at least 25 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
cKd-tree: A Compact Kd-tree.
IEEE Access, 2024

2021
An Efficient Algorithm to Count the Relations in a Range of Binary Relations Represented by a k²-Tree.
IEEE Access, 2021

2020
Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure.
Knowl. Inf. Syst., 2020

cBiK: A Space-Efficient Data Structure for Spatial Keyword Queries.
IEEE Access, 2020

Compressed Data Structures for Binary Relations in Practice.
IEEE Access, 2020

2019
Set operations over compressed binary relations.
Inf. Syst., 2019

Efficient processing of raster and vector data.
CoRR, 2019

A Compact Representation of Raster Time Series.
Proceedings of the Data Compression Conference, 2019

2018
Linear separability in spatial databases.
Knowl. Inf. Syst., 2018

The largest empty circle with location constraints in spatial databases.
Knowl. Inf. Syst., 2018

A Compact Memory-based Index for Spatial Keyword Query Resolution.
Proceedings of the 37th International Conference of the Chilean Computer Science Society, 2018

Efficient Processing of top-K Vector-Raster Queries Over Compressed Data.
Proceedings of the 2018 Data Compression Conference, 2018

Algorithm to Calculate the Hausdorff Distance on Sets of Points Represented by k2-Tree.
Proceedings of the XLIV Latin American Computer Conference, 2018

2017
A Genetic Algorithm for the Generation of Packetization Masks for Robust Image Communication.
Sensors, 2017

Efficiently Querying Vector and Raster Data.
Comput. J., 2017

K<sup>2</sup>-treaps to represent and query data warehouses into main memory.
Proceedings of the 36th International Conference of the Chilean Computer Science Society, 2017

Improved Queryable Representations of Rasters.
Proceedings of the 2017 Data Compression Conference, 2017

2015
A Method to Find Functional Dependencies Through Refutations and Duality of Hypergraphs.
Comput. J., 2015

Efficient Set Operations over k2-Trees.
Proceedings of the 2015 Data Compression Conference, 2015

2014
The largest empty rectangle containing only a query object in Spatial Databases.
GeoInformatica, 2014

2013
The k closest pairs in spatial databases - When only one set is indexed.
GeoInformatica, 2013

2012
Finding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases.
Proceedings of the Scientific and Statistical Database Management, 2012

2010
Closest Pair Query on Spatial Data Sets without Index.
Proceedings of the SCCC 2010, 2010

2008
Paralelización de Consultas del tipo time-interval en Base de Espacio-Temporales.
Proceedings of the VII Jornadas Iberoamericanas de Ingeniería de Software e Ingeniería del Conocimiento 2008, Guayaquil, Ecuador, January 30, 2008

2005
A spatio-temporal access method based on snapshots and events.
Proceedings of the 13th ACM International Workshop on Geographic Information Systems, 2005


  Loading...