Results 1  10
of
74,105
Optimal information transfer in the cortex through synchronization
, 2010
"... In recent experimental work it has been shown that neuronal interactions are modulated by neuronal synchronization and that this modulation depends on phase shifts in neuronal oscillations. This result suggests that connections in a network can be shaped through synchronization. Here, we test and ex ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
and expand this hypothesis using a model network. We use transfer entropy, an information theoretical measure, to quantify the exchanged information. We show that transferred information depends on the phase relation of the signal, that the amount of exchanged information increases as a function
E.: Timeoptimal information transfer in spintronic networks. to appear
 In: Proceedings of IEEE CDC (2015), Preprint arXiv:1508.00928
"... Abstract — Propagation of information encoded in spin degrees of freedom through networks of coupled spins enables important applications in spintronics and quantum information processing. We study control of information propagation in rings of 12spins with uniform nearest neighbour couplings form ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
forming a ring with a single excitation in the network as simple prototype of a router for spinbased information. Specifically optimising spatially distributed potentials, which remain constant during information transfer, simplifies the implementation of the routing scheme. However, the limited degrees
Optimal Brain Damage
, 1990
"... We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved sp ..."
Abstract

Cited by 510 (5 self)
 Add to MetaCart
We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved
Image Quilting for Texture Synthesis and Transfer
, 2001
"... We present a simple imagebased method of generating novel visual appearance in which a new image is synthesized by stitching together small patches of existing images. We call this process image quilting. First, we use quilting as a fast and very simple texture synthesis algorithm which produces s ..."
Abstract

Cited by 699 (18 self)
 Add to MetaCart
surprisingly good results for a wide range of textures. Second, we extend the algorithm to perform texture transfer  rendering an object with a texture taken from a different object. More generally, we demonstrate how an image can be rerendered in the style of a different image. The method works directly
No Free Lunch Theorems for Optimization
, 1997
"... A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of “no free lunch ” (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performan ..."
Abstract

Cited by 961 (10 self)
 Add to MetaCart
by performance over another class. These theorems result in a geometric interpretation of what it means for an algorithm to be well suited to an optimization problem. Applications of the NFL theorems to informationtheoretic aspects of optimization and benchmark measures of performance are also presented. Other
Hypertext Transfer Protocol  HTTP/1.1
, 1996
"... The Hypertext Transfer Protocol (HTTP) is an applicationlevel protocol for distributed, collaborative, hypermedia information systems. It is a generic, stateless, objectoriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through exten ..."
Abstract

Cited by 908 (27 self)
 Add to MetaCart
The Hypertext Transfer Protocol (HTTP) is an applicationlevel protocol for distributed, collaborative, hypermedia information systems. It is a generic, stateless, objectoriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through
The information bottleneck method
, 1999
"... We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. ..."
Abstract

Cited by 540 (35 self)
 Add to MetaCart
We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken
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 1967 (24 self)
 Add to MetaCart
coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract

Cited by 873 (26 self)
 Add to MetaCart
by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold
Results 1  10
of
74,105