3708 search results - page 108 / 742 » Approximating Betweenness Centrality |
81
Voted
ACSC
2006
IEEE
15 years 6 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
128
click to vote
JCM
2008
15 years 19 days ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
92
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
123
click to vote
JCSS
2002
15 years 10 days ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
127
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
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...