Sciweavers

2079 search results - page 364 / 416
» Quantifying Information Flow
Sort
View
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 7 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
CORR
2010
Springer
197views Education» more  CORR 2010»
13 years 7 months ago
Modelling of Human Glottis in VLSI for Low Power Architectures
The Glottal Source is an important component of voice as it can be considered as the excitation signal to the voice apparatus. Nowadays, new techniques of speech processing such a...
Nikhil Raj, R. K. Sharma
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 7 months ago
A System Theoretic Approach to Bandwidth Estimation
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...
CVIU
2008
180views more  CVIU 2008»
13 years 7 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
ENTCS
2008
138views more  ENTCS 2008»
13 years 7 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo