Sciweavers

570 search results - page 108 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
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 ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SLIP
2005
ACM
14 years 1 months ago
Congestion prediction in early stages
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...
Chiu-Wing Sham, Evangeline F. Y. Young
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Distributed Estimation and False Data Detection with Application to Power Networks
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...
Fabio Pasqualetti, Ruggero Carli, Francesco Bullo
NSDI
2007
13 years 10 months ago
A Systematic Framework for Unearthing the Missing Links: Measurements and Impact
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...
Yihua He, Georgos Siganos, Michalis Faloutsos, Sri...
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 months ago
Continuous Subgraph Pattern Search over Graph Streams
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...
Changliang Wang, Lei Chen 0002