Sciweavers

1511 search results - page 48 / 303
» Randomness, lowness and degrees
Sort
View
SJ
2011
14 years 6 months ago
Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted Disruptions
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
Kang Zhao, Akhil Kumar, Terry P. Harrison, John Ye...
ICC
2009
IEEE
15 years 6 months ago
Random Linear Network Coding for Time Division Duplexing: Energy Analysis
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
AISC
1998
Springer
15 years 4 months ago
Real Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
J. Rafael Sendra, Franz Winkler
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
14 years 11 months ago
On Short Multiplications and Divisions
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
Thom Mulders
MEDIAFORENSICS
2010
15 years 1 months ago
Fast identification of highly distorted images
In this paper, we consider a low complexity identification system for highly distorted images. The performance of the proposed identification system is analyzed based on the avera...
Taras Holotyak, Sviatoslav Voloshynovskiy, Fokko B...