665 search results - page 6 / 133 » A Sub-cubic Time Algorithm for the k -Maximum Subarray Probl... |
94
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
138
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
213
Voted
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
SWAT
1990
Springer
15 years 6 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
109
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...