Sciweavers

848 search results - page 41 / 170
» Randomness and the linear degrees of computability
Sort
View
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
15 years 3 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
16 years 3 days ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
ICC
2007
IEEE
107views Communications» more  ICC 2007»
15 years 6 months 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 ...
CVPR
2010
IEEE
15 years 2 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
WG
2001
Springer
15 years 4 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...