Sciweavers

1089 search results - page 10 / 218
» Randomness and Reducibility
Sort
View
JSAC
2007
97views more  JSAC 2007»
13 years 7 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
IOLTS
2000
IEEE
105views Hardware» more  IOLTS 2000»
14 years 2 days ago
Comparison between Random and Pseudo-Random Generation for BIST of Delay, Stuck-at and Bridging Faults
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
Patrick Girard, Christian Landrault, Serge Pravoss...
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
LCTRTS
1999
Springer
13 years 12 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...
VTC
2008
IEEE
160views Communications» more  VTC 2008»
14 years 2 months ago
Reducing Feedback Requirements of the Multiple Weight Opportunistic Beamforming Scheme via Selective Multiuser Diversity
—Opportunistic beamforming (OB) relies on the transmission of Channel State Information (CSI) in the form of instantaneous Signal to Noise Ratio (SNR) from Mobile Stations (MSs) ...
Marios Nicolaou, Angela Doufexi, Simon Armour