Sciweavers

10608 search results - page 239 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
91
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 10 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
Ioannis K. Paparrizos
109
Voted
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
15 years 2 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
80
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
An Adaptive-Scaling Tone Reservation Algorithm for PAR Reduction in OFDM Systems
— Existing tone-reservation algorithms (such as the controlled clipper algorithm) for OFDM require a number of iterations to ensure the reduction of Peak-to-Average Power Ratio (...
Luqing Wang, Chintha Tellambura
MOC
1998
107views more  MOC 1998»
15 years 3 days ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 23 days ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala