Sciweavers

7930 search results - page 62 / 1586
» Greedy in Approximation Algorithms
Sort
View
136
Voted
ICASSP
2010
IEEE
14 years 9 months ago
Using reed-muller sequences as deterministic compressed sensing matrices for image reconstruction
An image reconstruction algorithm using compressed sensing (CS) with deterministic matrices of second-order ReedMuller (RM) sequences is introduced. The 1D algorithm of Howard et ...
Kangyu Ni, Somantika Datta, Prasun Mahanti, Svetla...
138
Voted
CISS
2007
IEEE
15 years 6 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu

Publication
433views
15 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
110
Voted
CVPR
2012
IEEE
13 years 5 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
EVOW
2004
Springer
15 years 8 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting