Sciweavers

2484 search results - page 270 / 497
» Polymatroids with Network Coding
Sort
View
ICNP
2006
IEEE
14 years 2 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
PDP
2005
IEEE
14 years 1 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
BIOADIT
2006
Springer
14 years 2 days ago
Attractor Memory with Self-organizing Input
We propose a neural network based autoassociative memory system for unsupervised learning. This system is intended to be an example of how a general information processing architec...
Christopher Johansson, Anders Lansner
JCC
2011
105views more  JCC 2011»
13 years 3 months ago
Wordom: A user-friendly program for the analysis of molecular structures, trajectories, and free energy surfaces
Abstract: Wordom is a versatile, user-friendly, and efficient program for manipulation and analysis of molecular structures and dynamics. The following new analysis modules have b...
Michele Seeber, Angelo Felline, Francesco Raimondi...
TIT
2011
109views more  TIT 2011»
13 years 3 months ago
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...