Results 1 - 10
of
4,820
Reliability of the Gaussian Broadcast Channel with Common Message and Feedback
"... Abstract—We consider the two-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with message points, in the spirit of Schalkwijk&Kailath’s scheme for point-to-point channels or Ozarow&Leung’s scheme for BCs with private ..."
Abstract
- Add to MetaCart
Abstract—We consider the two-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with message points, in the spirit of Schalkwijk&Kailath’s scheme for point-to-point channels or Ozarow&Leung’s scheme for BCs
Clustering by passing messages between data points
- Science
, 2007
"... Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initi ..."
Abstract
-
Cited by 696 (8 self)
- Add to MetaCart
if that initial choice is close to a good solution. We devised a method called “affinity propagation,” which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges
Trading is hazardous to your wealth: The common stock investment performance of individual investors
- JOURNAL OF FINANCE
, 2000
"... Individual investors who hold common stocks directly pay a tremendous performance penalty for active trading. Of 66,465 households with accounts at a large discount broker during 1991 to 1996, those that trade most earn an annual return of 11.4 percent, while the market returns 17.9 percent. The ave ..."
Abstract
-
Cited by 494 (27 self)
- Add to MetaCart
Individual investors who hold common stocks directly pay a tremendous performance penalty for active trading. Of 66,465 households with accounts at a large discount broker during 1991 to 1996, those that trade most earn an annual return of 11.4 percent, while the market returns 17.9 percent
Reliability of the Gaussian Broadcast Channel with Common Message and Feedback
"... We consider the two-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with message points, in the spirit of Schalkwijk&Kailath’s scheme for point-to-point channels or Ozarow&Leung’s scheme for BCs with private message ..."
Abstract
- Add to MetaCart
We consider the two-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with message points, in the spirit of Schalkwijk&Kailath’s scheme for point-to-point channels or Ozarow&Leung’s scheme for BCs with private
On Broadcast with a Common Message over Networks
"... We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cut-set bounds. F ..."
Abstract
- Add to MetaCart
We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cut-set bounds
Symmetric Two-User Gaussian Interference Channel with Common Messages
"... We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is to send no common messages and each receiver treats interfe ..."
Abstract
- Add to MetaCart
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is to send no common messages and each receiver treats
Gaussian broadcast channels with confidential and common messages
- in Proc. IEEE Int. Symp. Inf. Theory
, 2010
"... Abstract — In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over a Gaussian bro ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi
Secure multiplex coding with a common message
- in Proc. ISIT 2011, Saint-Petersburg
, 2011
"... ar ..."
Abstract CMLOG: A Common Message Logging System
"... object-oriented and distributed system that not only allows applications and systems to log data (messages) of any type into a centralized database but also lets applications view incoming messages in real-time or retrieve stored data from the database according to selection rules. It consists of a ..."
Abstract
- Add to MetaCart
object-oriented and distributed system that not only allows applications and systems to log data (messages) of any type into a centralized database but also lets applications view incoming messages in real-time or retrieve stored data from the database according to selection rules. It consists of a
Results 1 - 10
of
4,820