Sciweavers

13841 search results - page 2572 / 2769
» Algorithms and Constraint Programming
Sort
View
ICALP
2007
Springer
15 years 9 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
138
Voted
ICALP
2007
Springer
15 years 9 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
121
Voted
ICALP
2007
Springer
15 years 9 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor
135
Voted
ICANN
2007
Springer
15 years 9 months ago
Selection of Decision Stumps in Bagging Ensembles
Abstract. This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble p...
Gonzalo Martínez-Muñoz, Daniel Hern&...
107
Voted
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
15 years 9 months ago
Automatic Design of ANNs by Means of GP for Data Mining Tasks: Iris Flower Classification Problem
This paper describes a new technique for automatically developing Artificial Neural Networks (ANNs) by means of an Evolutionary Computation (EC) tool, called Genetic Programming (G...
Daniel Rivero, Juan R. Rabuñal, Julian Dora...
« Prev « First page 2572 / 2769 Last » Next »