447 search results - page 59 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
COMPGEOM
2011
ACM
13 years 2 days ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
AAAI
2010
13 years 10 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...