Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PE
2008
Springer
114views Optimization» more  PE 2008»
10 years 2 months ago
Buffer overflow asymptotics for multiplexed regulated traffic
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
Yu Ying, Fabrice Guillemin, Ravi Mazumdar, Catheri...
APAL
2006
67views more  APAL 2006»
10 years 2 months ago
On partial randomness
If x = x1x2
Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
IPPS
2000
IEEE
10 years 7 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
10 years 7 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
INDOCRYPT
2003
Springer
10 years 7 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
GLOBECOM
2008
IEEE
10 years 9 months ago
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...
Michael R. Souryal, Huiqing You
books