We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
This study investigates whether deception in online dating profiles is detectable through a linguistic approach, which assumes that liars nonconsciously produce different word pat...
Nonprofit organizations working with high-risk vulnerable populations such as human trafficking victims often need to engage in a significant level of interorganizational collabor...
Jennifer Stoll, W. Keith Edwards, Elizabeth D. Myn...
In this work we examine nine different sources for user similarity as reflected by activity in social media applications. We suggest a classification of these sources into three c...
Ido Guy, Michal Jacovi, Adam Perer, Inbal Ronen, E...