1161 search results - page 33 / 233 » Approximation schemes for clustering problems |
162
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic na...
115
click to vote
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
139
Voted
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
JC
2007
14 years 9 months ago
2007
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...