Sciweavers

3136 search results - page 96 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
PERCOM
2008
ACM
16 years 5 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
ICASSP
2007
IEEE
16 years 18 days ago
Spatiotemporal Algorithm for Background Subtraction
Background modeling and subtraction is a fundamental task in many computer vision and video processing applications. We present a novel probabilistic background modeling and subtr...
S. Derin Babacan, Thrasyvoulos N. Pappas
GECCO
2004
Springer
126views Optimization» more  GECCO 2004»
15 years 11 months ago
A Gene Based Adaptive Mutation Strategy for Genetic Algorithms
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
Sima Uyar, Sanem Sariel, Gülsen Eryigit
PKDD
2010
Springer
160views Data Mining» more  PKDD 2010»
15 years 4 months ago
Sparse Unsupervised Dimensionality Reduction Algorithms
Abstract. Principal component analysis (PCA) and its dual—principal coordinate analysis (PCO)—are widely applied to unsupervised dimensionality reduction. In this paper, we sho...
Wenjun Dou, Guang Dai, Congfu Xu, Zhihua Zhang
ICASSP
2011
IEEE
14 years 10 months ago
A Kalman-like algorithm with no requirements for noise and initial conditions
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...
Yuriy S. Shmaliy