Sciweavers

393 search results - page 58 / 79
» Convex Programming Methods for Global Optimization
Sort
View
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 6 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
PLDI
1998
ACM
13 years 11 months ago
Quality and Speed in Linear-scan Register Allocation
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
Omri Traub, Glenn H. Holloway, Michael D. Smith
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 7 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
ICASSP
2011
IEEE
12 years 11 months ago
Error-entropy based channel state estimation of spatially correlated MIMO-OFDM
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen
ICCV
2011
IEEE
12 years 7 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...