57 search results - page 9 / 12 » Logarithmic hardness of the directed congestion minimization... |
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
155
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
DIALM
2003
ACM
15 years 2 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...