Sciweavers

123 search results - page 4 / 25
» Robust binary least squares: Relaxations and algorithms
Sort
View
CSDA
2007
127views more  CSDA 2007»
13 years 7 months ago
Computing the least quartile difference estimator in the plane
A common problem in linear regression is that largely aberrant values can strongly influence the results. The least quartile difference (LQD) regression estimator is highly robus...
Thorsten Bernholt, Robin Nunkesser, Karen Schettli...
VTC
2006
IEEE
156views Communications» more  VTC 2006»
14 years 1 months ago
Adaptive MBER Space-Time DFE Assisted Multiuser Detection for SDMA Systems
In this contribution we propose a space-time decision feedback equalization (ST-DFE) assisted multiuser detection (MUD) scheme for multiple antenna aided space division multiple a...
Sheng Chen, Andy Livingstone, Lajos Hanzo
SMI
2007
IEEE
194views Image Analysis» more  SMI 2007»
14 years 1 months ago
Robust Smooth Feature Extraction from Point Clouds
Defining sharp features in a given 3D model facilitates a better understanding of the surface and aids visualizations, reverse engineering, filtering, simplification, non-photo...
Joel Daniels II, Linh K. Ha, Tilo Ochotta, Cl&aacu...
CVPR
2008
IEEE
14 years 9 months ago
Relaxed matching kernels for robust image comparison
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...
Andrea Vedaldi, Stefano Soatto
ICASSP
2010
IEEE
13 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...