Sciweavers

1399 search results - page 21 / 280
» New Algorithms for k-Center and Extensions
Sort
View
RSA
2002
73views more  RSA 2002»
13 years 9 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
ICIP
2008
IEEE
14 years 3 months ago
Connected filtering by reconstruction: Basis and new advances
Openings-by-reconstruction are the oldest connected filters, and indeed, reconstruction methodology lies at the heart of many connected operators such as levelings. Starting out ...
Michael H. F. Wilkinson
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
14 years 1 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
ADHOC
2007
67views more  ADHOC 2007»
13 years 9 months ago
Threshold-related throughput - A new criterion for evaluation of sensor network performance
Energy efficient and power aware protocols are of utmost importance in Sensor Networks. The most popular criteria, so far, for evaluating performance of energy-aware protocols are...
Ilya Ledvich, Adrian Segall
CVPR
2012
IEEE
11 years 11 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos