Sciweavers

407 search results - page 45 / 82
» On the least median square problem
Sort
View
ICASSP
2009
IEEE
14 years 9 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
JMLR
2010
121views more  JMLR 2010»
14 years 6 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
JPDC
2006
148views more  JPDC 2006»
14 years 11 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 10 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari
ICCV
2005
IEEE
16 years 1 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros