Most current learning algorithms require both positive and negative data. This is also the case for many of the recent ensemble learning techniques. Applications of Boosting, for example, rely on both positive and negative data to produce a hypothesis with high predictive accuracy. In this technical report, a learning methodology is presented that does not rely on negative examples. A learning ...

A major step towards quantitative SPECT imaging may be achieved if attenuation, scatter and blurring effects are accounted for in the reconstruction process. Here we consider an approach which simultaneously estimates the unknown attenuation coefficient and the emission source using the emission data only. This leads to an inverse mathematical problem which could no longer be solved via iterati...

We present the first scalable, geo-replicated storage system that guarantees low latency, offers a rich data model, and provides “stronger” semantics. Namely, all client requests are satisfied in the local datacenter in which they arise; the system efficiently supports useful data model abstractions such as column families and counter columns; and clients can access data in a causallyconsistent...

In a series of recent papers Singh et al. have explored the idea of Simultaneous Localization and Mapping (SLAM) using range-only measurements. These measurements, obtained from radio or sonar sensors, come at irregular time intervals. In this report we explore the use of interpolation to generate data equally spaced in time, in order to improve the performance of SLAM algorithms. We test this ...

Sensitive information is present on our phones, disks, watches and computers. Its protection is essential. Plausible deniability of stored data allows individuals to deny that their device contains a piece of sensitive information. This constitutes a key tool in the fight against oppressive governments and censorship. Unfortunately, existing solutions, such as the now defunct TrueCrypt [5], can...

We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with O(logn) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P and for a given point q ∈ P , we sa...

Testing two-port memories requires the use of single-port tests as well as special two-port tests; the test strategy determines which tests to be used. Many two-port memories have ports which are read-only or write-only; this impacts the possible fault models, the tests for single-port and two-port memories, as well as the test strategy. This paper presents a test strategy for two-port memories...