1019 search results - page 67 / 204 » Uniform Functors on Sets |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
AFRIGRAPH
2006
ACM
14 years 1 months ago
2006
ACM
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
RULEML
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
ERCIMDL
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. We present a model for complex documents possibly consisting of a hierarchically structured set of images or texts. Documents are represented both at the form level (as s...
INFOCOM
1992
IEEE
13 years 11 months ago
1992
IEEE
A new packet switch architecture using two sets of time-division multiplexed buses is proposed. The horizontal buses collect packets from the input links, while the vertical buses ...