In this paper, we are going to answer the following question: assuming that we have estimates for the epipolar geometry and its uncertainty between two views, how probable it is t...
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks. The Page Rank [9] algorithm ranks web pages by propa...
Christian Borgs, Jennifer T. Chayes, Adam Tauman K...
—With the wide spread deployment of wireless LANs (WLANs), it is becoming necessary to conduct analysis of libraries of measurements taken from such operational networks. The ava...