5595 search results - page 268 / 1119 » Approximation Algorithms for Clustering Problems |
155
click to vote
COCO
2005
Springer
16 years 22 hour ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
197
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
163
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
207
click to vote
KDD
2004
ACM
15 years 12 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
150
click to vote
ICIP
2008
IEEE
16 years 28 days ago
2008
IEEE
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...