Sciweavers

6568 search results - page 80 / 1314
» Reducing the Complexity of Reductions
Sort
View
KDD
2002
ACM
126views Data Mining» more  KDD 2002»
16 years 6 months ago
Integrating feature and instance selection for text classification
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
Dimitris Fragoudis, Dimitris Meretakis, Spiros Lik...
FOCS
1990
IEEE
15 years 10 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
HPCA
2009
IEEE
16 years 6 months ago
Variation-aware dynamic voltage/frequency scaling
Fine-grained dynamic voltage/frequency scaling (DVFS) is an important tool in managing the balance between power and performance in chip-multiprocessors. Although manufacturing pr...
Sebastian Herbert, Diana Marculescu
GIS
2007
ACM
16 years 7 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
164
Voted
ICC
2007
IEEE
107views Communications» more  ICC 2007»
16 years 13 days ago
MLSE for DSTBC-OFDM Detection with Channel Estimation by Blind Linear Prediction and Subcarriers Interpolation
— This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-...
Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi ...