Sciweavers

2485 search results - page 468 / 497
» Distributed parameter estimation in networks
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 11 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
IJCNN
2007
IEEE
14 years 3 months ago
Generalised Kernel Machines
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
Gavin C. Cawley, Gareth J. Janacek, Nicola L. C. T...
ICDCS
2007
IEEE
14 years 16 days ago
Understanding Instant Messaging Traffic Characteristics
Instant messaging (IM) has become increasingly popular due to its quick response time, its ease of use, and possibility of multitasking. It is estimated that there are several mil...
Zhen Xiao, Lei Guo, John M. Tracey
PVLDB
2010
220views more  PVLDB 2010»
13 years 3 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
14 years 2 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...