9 citations · 22 across the 20 of their papers we have counts for
5 papers · 1 filter
Linear Separability in Spatial Databases
Gilberto Gutiérrez, Pablo Pérez-Lantero, Claudio Torres
Given two point sets and in the plane, with cardinalities and , respectively, and each set stored in a separate R-tree, we present an algorithm to decide whether …
Adaptive Computation of the Klee's Measure in High Dimensions
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
The KLEE'S MESURE of axis-parallel boxes in is the volume of their union. It can be computed in time within in the worst case. We describe three tec…
Refining the Analysis of Divide and Conquer: How and When
Jeremy Barbay, Carlos Ochoa, Pablo Perez-Lantero
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are…
Adaptive Computation of the Swap-Insert Correction Distance
Jérémy Barbay, Pablo Pérez-Lantero
The Swap-Insert Correction distance from a string of length to another string of length on the alphabet is the minimum number of insertions, and swap…
Interval Selection in the Streaming Model
Sergio Cabello, Pablo Pérez-Lantero
A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set of intervals and we want to find an in…