Sciweavers

1522 search results - page 68 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 2 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
PAMI
2010
276views more  PAMI 2010»
13 years 6 months ago
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
Yijun Sun, Sinisa Todorovic, Steve Goodison
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 1 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
ATAL
2010
Springer
13 years 9 months ago
Incentive analysis of approximately efficient allocation algorithms
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
Yevgeniy Vorobeychik, Yagil Engel