270 search results - page 37 / 54 » Partitioning into Sets of Bounded Cardinality |
EJC
2007
13 years 8 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
DATE
2006
IEEE
14 years 13 days ago
2006
IEEE
In current multi-media systems major parts of the functionality consist of software tasks executed on a set of concurrently operating processors. Those tasks interfere with each o...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
APDC
1997
13 years 10 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...