4110 search results - page 13 / 822 » Efficient algorithms for the 2-gathering problem |
ALGORITHMICA
2006
14 years 11 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
IPL
2008
14 years 11 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
CSCLP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
109
click to vote
ACCV
2007
Springer
15 years 3 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...