Sciweavers

23 search results - page 5 / 5
» Bounds on the metric and partition dimensions of a graph
Sort
View
112
Voted
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 6 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
EOR
2010
99views more  EOR 2010»
14 years 11 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
INFOCOM
2006
IEEE
15 years 5 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman