7006 search results - page 361 / 1402 » Approximation Algorithms |
112
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
149
click to vote
CC
2010
Springer
15 years 1 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
128
click to vote
ICALP
2005
Springer
15 years 10 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...
123
click to vote
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
116
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...