50 search results - page 3 / 10 » Improved Algorithms for the K-Maximum Subarray Problem for S... |
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
ADMA
2005
Springer
14 years 27 days ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
ESA
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...