1161 search results - page 72 / 233 » Approximation schemes for clustering problems |
107
click to vote
IANDC
2007
14 years 11 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
122
click to vote
ADCM
2011
14 years 7 months ago
2011
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
108
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
114
click to vote
IJACT
2008
14 years 12 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...