Sciweavers

65 search results - page 3 / 13
» On Computing Farthest Dominated Locations
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
MOBIHOC
2004
ACM
14 years 7 months ago
Locating cache proxies in manets
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...
Roy Friedman, Maria Gradinariu, Gwendal Simon
PERCOM
2005
ACM
14 years 7 months ago
Adaptive Location Management Scheme for Mobile IP
Mobile IP is a common standard to support global mobility of mobile hosts (MHs). One of the major problems for the Mobile IP is frequent location update and high signaling overhea...
Ha Won Kim, Sung Je Hong, Jong Kim
DAC
2006
ACM
14 years 8 months ago
Leakage power reduction of embedded memories on FPGAs through location assignment
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
Yan Meng, Timothy Sherwood, Ryan Kastner