649 search results - page 5 / 130 » An Improved Construction of Progression-Free Sets |
WADS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
DM
2008
13 years 10 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
MICCAI
2007
Springer
14 years 10 months ago
2007
Springer
We present an iterative bootstrapping framework to create and analyze statistical atlases of bony anatomy such as the human pelvis from a large collection of CT data sets. We creat...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
ECCC
2000
13 years 9 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...