Sciweavers

3875 search results - page 582 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
TCBB
2008
126views more  TCBB 2008»
15 years 6 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...
ICML
2007
IEEE
16 years 7 months ago
Supervised feature selection via dependence estimation
We introduce a framework for filtering features that employs the Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence between the features and the labels. The ...
Le Song, Alex J. Smola, Arthur Gretton, Karsten M....
VTC
2008
IEEE
224views Communications» more  VTC 2008»
16 years 27 days ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
16 years 21 days ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon