Sciweavers

82 search results - page 10 / 17
» Distributed Information-Theoretic Biclustering
Sort
View
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
14 years 2 months ago
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
14 years 29 days ago
Water-Filling for Watermarking?
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parall...
Deepa Kundur
UAI
2004
13 years 10 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
INFOCOM
2012
IEEE
11 years 11 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri