approximation algorithm
Very Fast Optimal Bandwidth Selection for Univariate Kernel Density Estimation
White Paper This paper proposes a computationally efficient å - exact approximation algorithm for the univariate Gaussian kernel based density derivative estimation that reduces the computational complexity from O(MN) to linear O(N + M). [11 Jul 2008]
Load Balancing by MPLS in Differentiated Services Networks
White Paper The second approximation divides traffic into parts and routes them consecutively using Dijkstra's algorithm. The first approximation defines the paths using the LP-optimization and after that allocates traffic using the NLP-optimization. [10 Jul 2008]
The Steiner k-Cut Problem
White Paper The study of linear programming relaxations for the Steiner k-cut problem was partly motivated by the goal of obtaining an approximation algorithm for the k-cut problem with a ratio better than. The results show that the available approximation... [03 Jul 2008]
Low Cost Residual Phase Tracking Algorithm for OFDM-Based WLAN Systems
White Paper It proposes a novel algorithm that uses an approximation instead of implementing the complex and vulnerable angle functions. This paper presents the design of an efficient low complexity orthogonal frequency division multiplexing receiver targeting... [03 Jul 2008]
Deterministic Wavelet Thresholding for Maximum-Error Metrics
White Paper For one-dimensional wavelets, the paper introduces an optimal, low polynomial-time thresholding algorithm based on a new Dynamic-Programming formulation that can be used to minimize either the maximum relative error or the maximum absolute error... [03 Jul 2008]
A Family of Algorithms for Approximate Bayesian Inference
White Paper This thesis presents an approximation technique that can perform Bayesian inference faster and more accurately than previously possible. On Gaussian mixture problems, Expectation Propagation is found, for the same amount of computation, to be... [03 Jul 2008]
Parameter Tuning of Rate-Based Congestion Control Algorithms and Its Application to TCP Over ABR
Its behavior is analyzed by utilizing a first-order fluid approximation to provide control parameter tuning. In this paper, the rate-based congestion control algorithm that has been standardized in the ATM Forum is evaluated. [06 Dec 2007]
A 16-Bit Cordic Rotator for High-Speed Wireless LAN
The VLSI architecture of the proposed design eliminates the entire arithmetic hardware in the angle approximation datapath and reduces the number of iterations by 50% on an average. The algorithm converges to the final target angle by adaptively... [06 Dec 2007]
Parameter Tuning of Rate-Based Congestion Control Algorithms and Its Application to TCP Over ABR
White Paper Its behavior is analyzed by utilizing a first-order fluid approximation to provide control parameter tuning. In this paper, the rate-based congestion control algorithm that has been standardized in the ATM Forum is evaluated. [05 Dec 2007]
A 16-Bit Cordic Rotator for High-Speed Wireless LAN
White Paper The VLSI architecture of the proposed design eliminates the entire arithmetic hardware in the angle approximation datapath and reduces the number of iterations by 50% on an average. The algorithm converges to the final target angle by adaptively... [05 Dec 2007]
Sender-Side TCP Modifications: An Analytical Study
A theoretical approach is used based on the use of queueing networks for the description of the protocol dynamics and a fixed point approximation to derive the working point of the IP network. This paper considers a number of modifications that can... [05 Dec 2007]
Sender-Side TCP Modifications: An Analytical Study
White Paper A theoretical approach is used based on the use of queueing networks for the description of the protocol dynamics and a fixed point approximation to derive the working point of the IP network. This paper considers a number of modifications that can... [04 Dec 2007]
Hierarchical Power-Aware Routing in Sensor Networks
White Paper The paper develops an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. To ensure scalability, it introduces a hierarchical algorithm, which is called zone-based routing. [23 Aug 2007]
Online Power-Aware Routing in Wireless Ad-hoc Networks
White Paper This paper develops an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. The paper shows that online power-aware routing does not have a constant competitive ratio to the off-line optimal algorithm. [23 Aug 2007]
Tree Based Data Aggregation in Sensor Networks Using Polynomial Regression
White Paper By function approximation based on multivariable polynomial regression and passing only the coefficients returned by the regression function instead of aggregated data, TREG achieves the following goals; the sink can get attribute values in... [23 Aug 2007]
Keep updated for stories matching approximation algorithm via RSS
