Sciweavers

316 search results - page 24 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 2 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
COMPGEOM
2005
ACM
13 years 9 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ICDCS
2012
IEEE
11 years 10 months ago
Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data
Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect prob...
Chi-Yao Hong, Matthew Caesar, Nick G. Duffield, Ji...
CIKM
2004
Springer
14 years 27 days ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar