Sciweavers

9119 search results - page 1496 / 1824
» A Simultaneous Search Problem
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Distributed beamforming for OFDM-based cooperative relay networks under total and per-relay power constraints
This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...
Wenjing Cheng, Qinfei Huang, Mounir Ghogho, Dongta...
ICASSP
2011
IEEE
14 years 8 months ago
Horizontal small target detection with cooperative background estimation and removal filters
Detecting small targets is essential for mitigating the seabased Infrared search and track (IRST) problem. It is easy to detect small targets in homogeneous backgrounds such as th...
Sungho Kim, Yukyung Yang, Joo-Hyoung Lee
DMGT
2011
94views more  DMGT 2011»
14 years 8 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 8 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
PODC
2011
ACM
14 years 7 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
« Prev « First page 1496 / 1824 Last » Next »