1331 search results - page 176 / 267 » Complexity bounds for zero-test algorithms |
130
click to vote
COMPGEOM
1993
ACM
15 years 7 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
123
click to vote
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
158
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
117
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
121
click to vote
IM
2007
15 years 3 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...