Results 1  10
of
368,750
On zeroerror source coding with decoder side information
 IEEE TRANS. INF. THEORY
, 2003
"... Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution (). The following source coding problem is considered: the encoder knows, while the decoder knows and wants to learn without error. The minimum zeroerror asymptotic rate of transmiss ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution (). The following source coding problem is considered: the encoder knows, while the decoder knows and wants to learn without error. The minimum zeroerror asymptotic rate
Zeroerror codes for correlated information sources
 in Proc. Conf. Cryptography
, 1997
"... Abstract. Stepian and W~olf [2] gave a characterization for the compression region of distributed correlated sources. Their result is for codes with a decoding probability of error approaching zero as the code length is increased. Of interest in many applications is to find codes for which the proba ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
the probability of error is exactly zero. For this latter case, block codes using the zeroerror information between the sources have been proposed by Witsenhausen [3]. Better codes, however, can be obtained by further exploitation of the statistical dependency impeded in the correlation information
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. In this paper, we study the problem with one information source, and we have obtained a simple characterization of the admissible
A RelayAssisted Distributed Source Coding Problem
"... Abstract — A relayassisted distributed source coding problem with three statistically correlated sources is formulated and studied. Natural lower bounds for the rates are presented. The lower bounds are shown to be achievable for three special classes of joint source distributions. The achievable c ..."
Abstract
 Add to MetaCart
Abstract — A relayassisted distributed source coding problem with three statistically correlated sources is formulated and studied. Natural lower bounds for the rates are presented. The lower bounds are shown to be achievable for three special classes of joint source distributions. The achievable
Understanding Code Mobility
 IEEE COMPUTER SCIENCE PRESS
, 1998
"... The technologies, architectures, and methodologies traditionally used to develop distributed applications exhibit a variety of limitations and drawbacks when applied to large scale distributed settings (e.g., the Internet). In particular, they fail in providing the desired degree of configurability, ..."
Abstract

Cited by 549 (34 self)
 Add to MetaCart
, code mobility is generating a growing body of scientific literature and industrial developments. Nevertheless, the field is still characterized by the lack of a sound and comprehensive body of concepts and terms. As a consequence, it is rather difficult to understand, assess, and compare the existing
Wrapper Induction for Information Extraction
, 1997
"... The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract

Cited by 612 (30 self)
 Add to MetaCart
The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources
Results 1  10
of
368,750