CORR
2012
Springer
12 years 7 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
CORR
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
Molecular biology data are subject to terms of use that vary widely between databases and curating institutions. This research presents a taxonomy of contractual and technical res...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
In this paper we introduce a new type of pattern – a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at diffe...
CORR
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...