Sciweavers

158 search results - page 14 / 32
» Solving Box-Constrained Integer Least Squares Problems
Sort
View
COLOGNETWENTE
2010
13 years 4 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
ICASSP
2009
IEEE
13 years 5 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
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 2 months ago
Convergence analysis of a proximal Gauss-Newton method
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
Saverio Salzo, Silvia Villa
TSP
2010
13 years 2 months ago
Joint time synchronization and localization of an unknown node in wireless sensor networks
Abstract--Time synchronization and localization are two important issues in wireless sensor networks. Although these two problems share many aspects in common, they are traditional...
Jun Zheng, Yik-Chung Wu
JCST
2008
85views more  JCST 2008»
13 years 7 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...