242 search results - page 5 / 49 » Approximate substring selectivity estimation |
85
Voted
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
108
Voted
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper addresses soft estimation of time-varying frequency selective channels using Kalman smoothing. The proposed estimator uses soft extrinsic information provided by a c...
110
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
115
Voted
ICMCS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
113
Voted
CIAC
2000
Springer
15 years 5 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...