Sciweavers

2168 search results - page 163 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 5 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
MOBICOM
2005
ACM
15 years 9 months ago
Using mobile relays to prolong the lifetime of wireless sensor networks
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple s...
Wei Wang 0002, Vikram Srinivasan, Kee Chaing Chua
ICASSP
2011
IEEE
14 years 8 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
ECCV
2004
Springer
15 years 9 months ago
Pose Invariant Face Recognition Under Arbitrary Unknown Lighting Using Spherical Harmonics
Abstract. We propose a new method for face recognition under arbitrary pose and illumination conditions, which requires only one training image per subject. Furthermore, no limitat...
Lei Zhang 0002, Dimitris Samaras
NAACL
2010
15 years 2 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos