Sciweavers

1331 search results - page 110 / 267
» Complexity bounds for zero-test algorithms
Sort
View
GLOBECOM
2007
IEEE
13 years 10 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 5 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 11 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
NIPS
2004
13 years 11 months ago
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments
A reactive environment is one that responds to the actions of an agent rather than evolving obliviously. In reactive environments, experts algorithms must balance exploration and ...
Daniela Pucci de Farias, Nimrod Megiddo
DMIN
2007
203views Data Mining» more  DMIN 2007»
13 years 11 months ago
Evaluation of Feature Selection Techniques for Analysis of Functional MRI and EEG
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
Lauren Burrell, Otis Smart, George J. Georgoulas, ...