-
Mini-Batch Metropolis–Hastings With Reversible SGLD Proposal
Traditional Markov chain Monte Carlo (MCMC) algorithms are computationally intensive and do not scale well to large data. In particular, the Metropolis–Hastings (MH) algorithm... -
dedup_wf_001--4ca16bd1aa9584cd245c106419e69e34
In this article we examine the differences between weekly and daily time cycles in the nineteenth-century Hebrew newspaper HaTzfira. This newspaper changed its publication... -
Characterizing traveling fans: a workflow for event-oriented travel pattern a...
Characterizing event attendees’ travel patterns is key to understanding the dynamics of social events in cities. However, the scientific investigation of event travel patterns...
