Sciweavers

3422 search results - page 244 / 685
» Random Subset Optimization
Sort
View
DCC
2007
IEEE
16 years 5 months ago
Quantization of Sparse Representations
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...
Petros Boufounos, Richard G. Baraniuk
CVPR
2010
IEEE
16 years 2 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
16 years 26 days ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 12 months ago
Meta-grammar constant creation with grammatical evolution by grammatical evolution
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
SPAA
2000
ACM
15 years 10 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...