429 search results - page 44 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
102
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
153
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
136
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
148
click to vote
FCT
1993
Springer
15 years 8 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
147
click to vote
TIP
2010
14 years 11 months ago
2010
Multivariate image segmentation is a challenging task, influenced by large intraclass variation that reduces class distinguishability as well as increased feature space sparseness ...