Sciweavers

513 search results - page 32 / 103
» Finitely Based, Finite Sets of Words
Sort
View
MMAS
2010
Springer
13 years 3 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
DM
2010
88views more  DM 2010»
13 years 8 months ago
Multidimensional generalized automatic sequences and shape-symmetric morphic words
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
Emilie Charlier, Tomi Kärki, Michel Rigo
VMV
2008
129views Visualization» more  VMV 2008»
13 years 10 months ago
Shape Median Based on Symmetric Area Differences
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 8 months ago
Temporal Logics on Words with Multiple Data Values
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
Ahmet Kara, Thomas Schwentick, Thomas Zeume
SOFSEM
2010
Springer
13 years 6 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla