We present a new appearance model for online multi-target tracking, where a patch-based representation of each target to be tracked is introduced along with a sequential update scheme, which we call “motion agreement tracking” (MAT). This method updates the appearance model of each target online by indirectly evaluating the motion consistency among its local patches. We show that a distance mea...

In 2013 we published an analysis demonstrating that drug response data and gene-drug associations reported in two independent large-scale pharmacogenomic screens, Genomics of Drug Sensitivity in Cancer (GDSC) and Cancer Cell Line Encyclopedia (CCLE), were inconsistent. The GDSC and CCLE investigators recently reported that their respective studies exhibit reasonable agreement and yield similar ...

Most linguistic theories of language offer analysis of agreement describing the rules and constraints involved in the computation and interpretation of this dependency. A good testing ground for theoretical accounts of agreement is mismatching patterns. In this article we focus on a mismatch available in the Spanish agreement system – Unagreement – in which there is a person mismatch in the rea...

Diagnostic agreement tests the reliability and concordance of diagnostic systems. The introduction of measures of agreement with reputations for baserate independence (e.g., Yule's Y and Q), and new studies occasioned by the publication of the Diagnostic and Statistical Manual of Mental Disorders (4th ed.; DSM-IV; American Psychiatric Association, 1994) and the International Classification of D...

Assuming that there is an a priori agreement between processes on the names of shared memory locations, as done in almost all the publications on shared memory algorithms, is tantamount to assuming that agreement has already been solved at the lower-level. From a theoretical point of view, it is intriguing to €gure out how coordination can be achieved without relying on such lower-level agreeme...

Distributed systems increasingly rely on fault-tolerant and secure authorization services. An essential primitive used to implement such services is the Byzantine agreement protocol for achieving agreement among n parties even if t parties (t < n/3) are corrupt and behave maliciously. We describe our experience verifying the randomized protocol ABBA (Asynchronous Binary Byzantine Agreement) of ...

Caveat: This report represents work-in-progress, and provides some of our early results on the topic. A more complete version of this report, with additional results not presented in this draft, and improved description of the algorithms and analysis, will be released later this year. This draft version contains known problems with clarity/readability and the descriptions are incomplete/impreci...

How can collective decisions be made among individuals with conflicting preferences or judgments? Arrow’s impossibility theorem and other social-choice-theoretic results suggest that, for many collective decision problems, there are no attractive democratic solutions. In response, deliberative democrats argue that group deliberation makes collective decisions more tractable. How can deliberatio...