1040 search results - page 34 / 208 » Rounding algorithms for covering problems |
ICML
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
STOC
1999
ACM
14 years 1 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
JMLR
2002
13 years 8 months ago
2002
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...