## Search

Now showing items 21-30 of 32

#### Comparison of Discrete and Continuous Models for the Pooling Problem

(Dagstuhl Publishing, 2011)

The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and
solved by branch-and-bound ...

#### The State of the Art in Topology-based Visualization of Unsteady Flow

(Blackwell Publishing Ltd., 2011)

Vector fields are a common concept for the representation of
many different kinds of flow phenomena in science and engineering.
Methods based on vector field topology are known for
their convenience for visualizing and ...

#### A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

(Springer, 2011-01-21)

In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...

#### Proofs, Types and Lambda Calculus - datasets

(2012-02-28)

#### Structure of Polynomial-Time Approximation

(Springer, 2011-10-14)

Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas). To properly differentiate between approximation schemes ...

#### CCZ-equivalence of bent vectorial functions and related constructions

(Springer, 2011-01-06)

We observe that the CCZ-equivalence of bent vectorial functions over F2nFn2 (n even) reduces to their EA-equivalence. Then we show that in spite of this fact, CCZ-equivalence can be used for constructing bent functions ...

#### Directed graph representation of half-rate additive codes over GF(4)

(Springer, 2010)

We show that (n, 2n) additive codes over GF(4) can be represented as directed
graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond
to undirected graphs. Graph representation ...

#### Coherent Conformational Degrees of Freedom as a Structural Basis for Allosteric Communication

(Public Library of Science, 2011-12-08)

Conformational changes in allosteric regulation can to a large extent be described as motion along one or a few coherent
degrees of freedom. The states involved are inherent to the protein, in the sense that they are ...

#### Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow

(Springer, 2012)

In many cases, feature detection for flow visualization is structured
in two phases: first candidate identification, and then filtering.
With this paper, we propose to use the directional information contained
in the ...

#### Sparse Boolean equations and circuit lattices

(Springer, 2010)

A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...