Buscar
Mostrando ítems 1-10 de 3697
Computing coverage kernels under restricted settings
(Springer Verlag, 2018)
We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, ...
Depth distribution in high dimensions
(Springer, 2017)
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set mathcal {B} of axis aligned boxes, whose computation generalizes that of the Klee’s Measure and of ...
Fast and compact planar embeddings
(Springer, 2017)
There are many representations of planar graphs but few are as elegant as Turán’s (1984): it is simple and practical, uses only four bits per edge, can handle multi-edges and can store any specified embedding. Its main ...
Approximately coloring graphs without long induced paths
(Springer, 2017)
It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...
Chemical foundations of distributed aspects
(Springer Verlag, 2019)
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. Distributed applications are challenging to program because they have to deal with a plethora of concerns, including synchronization, locality, replication, ...
Gradual program verification
(Springer Verlag, 2018)
Both static and dynamic program verification approaches have significant disadvantages when considered in isolation. Inspired by research on gradual typing, we propose gradual verification to seamlessly and flexibly combine ...
Efficient compression and indexing of trajectories
(Springer, 2017)
We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical ...
LZ78 compression in low main memory space
(Springer, 2017)
We present the first algorithms that perform the LZ78 compression of a text of length n over alphabet [1..σ], whose output is z integers, using only O(z lg σ) bits of main memory. The algorithms read the input text from ...
A self-index on block trees
(Springer, 2017)
The Block Tree is a recently proposed data structure that reaches compression close to Lempel-Ziv while supporting efficient direct access to text substrings. In this paper we show how a self-index can be built on top of ...
Towards hospitalization after readmission risk prediction using ELMs
(Springer Verlag, 2017)
A criteria to evaluate the performance of Emergency Departments (ED) is the number of readmissions and hospitalizations short time after discharge of patients because the problem was not solved in the first admission. Such ...