Sciweavers

5372 search results - page 239 / 1075
» complexity 2007
Sort
View
DM
2007
84views more  DM 2007»
13 years 8 months ago
The topology of spaces of phylogenetic trees with symmetry
Natural Dowling analogues of the complex of phylogenetic trees are studied. Using discrete Morse theory, we find their homotopy types. In the process, the homotopy types of certai...
Axel Hultman
ECCC
2007
86views more  ECCC 2007»
13 years 8 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
MMS
2008
13 years 8 months ago
Production and multi-channel distribution of news
News production is characterized by a complex and dynamic workflow as it is important to produce and distribute news as soon as possible and in an audio-visual quality as good as ...
Erik Mannens, Maarten Verwaest, Rik Van de Walle
IJFCS
2007
80views more  IJFCS 2007»
13 years 8 months ago
Bisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...
MLQ
2007
108views more  MLQ 2007»
13 years 7 months ago
Coloring linear orders with Rado's partial order
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
Riccardo Camerlo, Alberto Marcone