352 search results - page 22 / 71 » A local search approximation algorithm for k-means clusterin... |
TALG
2010
14 years 8 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
52
Voted
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
112
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
66
Voted
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
The mechanism of gene regulation has been studied intensely for decades. It is important to identify synergistic transcriptional motifs. Its search space is so large that an effici...