Titlebook: SOFSEM 2011: Theory and Practice of Computer Science; 37th Conference on C Ivana Černá,Tibor Gyimóthy,Stefan Wolf Conference proceedings 20

Fallibility

,Liquidsoap: A High-Level Programming Language for Multimedia Streaming,proach in order to achieve it, based on a dedicated high-level functional programming language, called ., for generating, manipulating and broadcasting multimedia streams. Unlike traditional approaches, which are based on configuration files or static graphical interfaces, it also allows the user to

gnarled

Combining Traditional Map Labeling with Boundary Labeling,icient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly inter

Campaign

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion,imum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W[2]-hard when parameterized by the graph’s feedback arc set

锯齿状

Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size,ary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Only two years ago, the question whether the deterministic OBDD complexity of the most significant bit of integer multiplication is exponential has been answered affirmatively. Since probabilistic

GUILT

自作多情

Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions, of scalar multiplications, communication overhead in a multiprocessor environment, etc. For . matrices our optimization procedure requires .(..) arithmetic operations per one cost function. This work is done in the framework of a dynamic programming extension that allows sequential optimization rel

LAPSE

One-Reversal Counter Machines and Multihead Automata: Revisited,way input heads) and 1-reversal counter machines (finite automata with multiple counters, where each counter can only “reverse” once, i.e., once a counter decrements, it can no longer increment). The devices can be deterministic or nondeterministic and can be augmented with a pushdown stack. We inve

脆弱么

Collisionless Gathering of Robots with an Extent,y, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the r

aplomb

eczema