147
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge fo...
138
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
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...
160
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
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...
151
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
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...
165
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
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...
197
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
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 ...
142
click to vote
CORR
2012
Springer
14 years 12 days 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 ...
102
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
146
click to vote
CORR
2012
Springer
14 years 12 days 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...