Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
Greg Bruno, Mason J. Katz, Federico D. Sacerdoti, ...
In the past decade, information theory has been studied extensively in computational imaging. In particular, image matching by maximizing mutual information has been shown to yiel...
Igor Yanovsky, Paul M. Thompson, Stanley Osher, Al...
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...