Sciweavers

242 search results - page 5 / 49
» Approximate substring selectivity estimation
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Efficient Model Selection for Kernel Logistic Regression
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
Gavin C. Cawley, Nicola L. C. Talbot
ICC
2007
IEEE
14 years 1 months ago
Soft Estimation of Time-Varying Frequency Selective Channels Using Kalman Smoothing
— 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...
Valery Ramon, Cédric Herzet, Xavier Wautele...
ICASSP
2010
IEEE
13 years 7 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
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-...
Steffen Barembruch
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 28 days ago
Approximating the selectivity of multimedia range queries
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...
Mario Döller, Harald Kosch
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
13 years 11 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
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 ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...