Sciweavers

174 search results - page 3 / 35
» Algorithms for center and Tverberg points
Sort
View
CCR
2010
132views more  CCR 2010»
13 years 3 months ago
Scafida: a scale-free network inspired data center architecture
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
László Gyarmati, Tuan Anh Trinh
GLOBECOM
2007
IEEE
14 years 18 days ago
Localization and Intensity Tracking of Diffusing Point Sources Using Sensor Networks
— We consider a network of spatially distributed sensors deployed to track the intensity of a diffusing source whose location is fixed, but unknown. The sensors make discrete ti...
S. Sundhar Ram, Venugopal V. Veeravalli
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 10 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
ESA
2008
Springer
81views Algorithms» more  ESA 2008»
13 years 8 months ago
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
Pankaj K. Agarwal, Jeff M. Phillips
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller