12519 search results - page 162 / 2504 » Approximation Problems Categories |
181
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
170
click to vote
WIDM
2006
ACM
16 years 11 days ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
180
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
184
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
189
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...