In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
This paper proposes a switching hypothesized measurements (SHM) model supporting multimodal probability distributions and presents the application of the model in handling potenti...
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...