667 search results - page 95 / 134 » Approximation algorithms for connected facility location pro... |
110
click to vote
MMNS
2003
15 years 1 months ago
2003
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
108
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
95
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
109
click to vote
AUSAI
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...