Sciweavers

703 search results - page 125 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
ICASSP
2011
IEEE
13 years 16 days ago
Eigenspace sparsity for compression and denoising
Sparsity in the eigenspace of signal covariance matrices is exploited in this paper for compression and denoising. Dimensionality reduction (DR) and quantization modules present i...
Ioannis D. Schizas, Georgios B. Giannakis
SIGECOM
2005
ACM
98views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Hidden-action in multi-hop routing
In multi-hop networks, the actions taken by individual intermediate nodes are typically hidden from the communicating endpoints; all the endpoints can observe is whether or not th...
Michal Feldman, John Chuang, Ion Stoica, Scott She...
BALT
2006
14 years 16 days ago
Pattern Repositories for Software Engineering Education
Abstract. Modern software engineering attacks its complexity problems by applying well-understood development principles. In particular, the systematic adoption of design patterns ...
Hans-Werner Sehring, Sebastian Bossung, Patrick Hu...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 9 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel