Sciweavers

CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 9 days ago
Computing Cartograms with Optimal Complexity
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 ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 9 days ago
Perfect Reconstruction of Oncogenetic Trees
In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
Charalampos E. Tsourakakis
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 9 days ago
Approximate Counting of Matchings in Sparse Hypergraphs
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...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
CORR
2012
Springer
227views Education» more  CORR 2012»
12 years 9 days ago
Trajectory and Policy Aware Sender Anonymity in Location Based Services
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 ...
Alin Deutsch, Richard Hull, Avinash Vyas, Kevin Ke...
CORR
2012
Springer
217views Education» more  CORR 2012»
12 years 9 days ago
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy
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...
Chao Li, Gerome Miklau
CORR
2012
Springer
205views Education» more  CORR 2012»
12 years 9 days ago
Check Your Data Freedom: A Taxonomy to Assess Life Science Database Openness
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...
Mélanie Dulong de Rosnay
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 9 days ago
Multiple-Source Shortest Paths in Embedded Graphs
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...
Sergio Cabello, Erin W. Chambers, Jeff Erickson
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 9 days ago
Fast Triangle Counting through Wedge Sampling
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...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
CORR
2012
Springer
202views Education» more  CORR 2012»
12 years 9 days ago
Mining Flipping Correlations from Large Datasets with Taxonomies
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...
Marina Barsky, Sangkyum Kim, Tim Weninger, Jiawei ...