570 search results - page 108 / 114 » Approximating Some Network Design Problems with Node Costs |
243
click to vote
SSD
2007
Springer
16 years 25 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
170
Voted
SLIP
2005
ACM
16 years 8 days ago
2005
ACM
Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominan...
205
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
200
Voted
NSDI
2007
15 years 9 months ago
2007
The lack of an accurate representation of the Internet topology at the Autonomous System (AS) level is a limiting factor in the design, simulation, and modeling efforts in inter-d...
222
Voted
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...