SIAMJO
2010
13 years 7 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
MP
2010
13 years 11 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
SIAMJO
2008
14 years 12 days ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
KES
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. This paper considers the sensor network localization problem using signal strength. Unlike range-based methods signal strength information is stored in a kernel matrix. L...
IPSN
2005
Springer
14 years 6 months ago
2005
Springer
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
DCOSS
2005
Springer
14 years 6 months ago
2005
Springer
Sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Locali...
PERCOM
2007
ACM
15 years 2 days ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...