796 search results - page 31 / 160 » Approximating the centroid is hard |
COCO
2001
Springer
14 years 3 days ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
DAC
1998
ACM
14 years 8 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
IJCAI
2003
13 years 9 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...