Sciweavers

388 search results - page 43 / 78
» An approximate algorithm for median graph computation using ...
Sort
View
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICRA
2007
IEEE
203views Robotics» more  ICRA 2007»
14 years 2 months ago
Energy Saving Target Tracking Using Mobile Sensor Networks
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...
Yingying Li, Yun-Hui Liu
ENDM
2008
93views more  ENDM 2008»
13 years 8 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
ECCV
2010
Springer
13 years 11 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 1 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim