Sciweavers

516 search results - page 37 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
AIRS
2004
Springer
14 years 3 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
EUROCAST
2003
Springer
130views Hardware» more  EUROCAST 2003»
14 years 3 months ago
A Model of Neural Inspiration for Local Accumulative Computation
This paper explores the computational capacity of a novel local computational model that expands the conventional analogical and logical dynamic neural models, based on the charge ...
José Mira, Miguel Angel Fernández, M...
DEDS
2007
104views more  DEDS 2007»
13 years 10 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
PROCEDIA
2010
123views more  PROCEDIA 2010»
13 years 8 months ago
Mean square convergence of a semidiscrete scheme for SPDEs of Zakai type driven by square integrable martingales
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
Annika Lang
COMPGEOM
2009
ACM
14 years 4 months ago
Straight skeletons of three-dimensional polyhedra
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
Gill Barequet, Amir Vaxman