Sciweavers

CORR
2012
Springer
185views Education» more  CORR 2012»
14 years 2 months ago
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
Johannes Textor, Maciej Liskiewicz
CORR
2012
Springer
229views Education» more  CORR 2012»
14 years 2 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
CORR
2012
Springer
205views Education» more  CORR 2012»
14 years 2 months ago
Pricing Data: A Look at Past Proposals, Current Plans, and Future Trends
Traditionally, network operators have only used simple flat-rate unlimited data plans to vie for customers. But today, with the popularity of mobile devices and exponential growt...
Soumya Sen, Carlee Joe-Wong, Sangtae Ha, Mung Chia...
CORR
2012
Springer
167views Education» more  CORR 2012»
14 years 2 months ago
Multidimensional counting grids: Inferring word order from disordered bags of words
Models of bags of words typically assume topic mixing so that the words in a single bag come from a limited number of topics. We show here that many sets of bag of words exhibit a...
Nebojsa Jojic, Alessandro Perina
CORR
2012
Springer
237views Education» more  CORR 2012»
14 years 2 months ago
Novel Component Based Development Model For Sip-Based Mobile Application
Universities and Institutions these days’ deals with issues related to with assessment of large number of students. Various evaluation methods have been adopted by examiners in ...
Ahmed Barnawi, Abdurrahman H. Al-Talhi, M. Rizwan ...
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 2 months 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»
14 years 2 months 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»
14 years 2 months 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»
14 years 2 months 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...