271 search results - page 35 / 55 » On the Online Unit Clustering Problem |
ALGORITHMICA
2010
13 years 9 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
NPIV
1998
ACM
14 years 1 months ago
1998
ACM
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
MM
2009
ACM
14 years 3 months ago
2009
ACM
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often s...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
EDM
2008
13 years 10 months ago
2008
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...