Sciweavers

33 search results - page 5 / 7
» On Algorithm for All-Pairs Most Reliable Quickest Paths
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
TASLP
2008
175views more  TASLP 2008»
13 years 7 months ago
A Variable Step-Size Affine Projection Algorithm Designed for Acoustic Echo Cancellation
Abstract--The adaptive algorithms used for acoustic echo cancellation (AEC) have to provide 1) high convergence rates and good tracking capabilities, since the acoustic environment...
Constantin Paleologu, Jacob Benesty, Silviu Ciochi...
VTC
2006
IEEE
135views Communications» more  VTC 2006»
14 years 1 months ago
A Detection Algorithm for Clipped OFDM Signals Using the IDFT-Matrix
A major drawback of the Orthogonal Frequency Division Multiplex (OFDM) principle is the high dynamic range of the transmit signal. The transmit Power Amplifier (PA) and other ele...
Andreas Frotzscher, Peter Zillmann, Gerhard Fettwe...
BROADNETS
2004
IEEE
13 years 10 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
CCR
2004
84views more  CCR 2004»
13 years 7 months ago
On making SCTP robust to spurious retransmissions
Network anomalies such as packet reordering and delay spikes can result in spurious retransmissions and degrade performance of reliable transport protocols such as TCP and SCTP. P...
Sourabh Ladha, Stephan Baucke, Reiner Ludwig, Paul...