Sciweavers

5606 search results - page 958 / 1122
» Randomization Techniques for Graphs.
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
15 years 28 days ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 10 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
FGR
2011
IEEE
209views Biometrics» more  FGR 2011»
14 years 10 months ago
Modeling hidden dynamics of multimodal cues for spontaneous agreement and disagreement recognition
— This paper attempts to recognize spontaneous agreement and disagreement based only on nonverbal multimodal cues. Related work has mainly used verbal and prosodic cues. We demon...
Konstantinos Bousmalis, Louis-Philippe Morency, Ma...
ICASSP
2011
IEEE
14 years 10 months ago
Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
Kun-Yu Wang, Tsung-Hui Chang, Wing-Kin Ma, Anthony...
ICASSP
2011
IEEE
14 years 10 months ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu