113 search results - page 5 / 23 » Obnoxious Centers in Graphs |
104
click to vote
CISS
2007
IEEE
15 years 1 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
72
Voted
ICCSA
2010
Springer
14 years 11 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
108
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
87
Voted
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...