Sciweavers

213 search results - page 28 / 43
» Relating Word and Tree Automata
Sort
View
ENTCS
2007
143views more  ENTCS 2007»
13 years 7 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
SIAMNUM
2010
123views more  SIAMNUM 2010»
13 years 2 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna
ISPDC
2006
IEEE
14 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
MT
2010
134views more  MT 2010»
13 years 6 months ago
Improve syntax-based translation using deep syntactic structures
This paper introduces deep syntactic structures to syntax-based Statistical Machine Translation (SMT). We use a Head-driven Phrase Structure Grammar (HPSG) parser to obtain the de...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii
SIGGRAPH
1999
ACM
13 years 11 months ago
Art-based Rendering of Fur, Grass, and Trees
Artists and illustrators can evoke the complexity of fur or vegetation with relatively few well-placed strokes. We present an algorithm that uses strokes to render 3D computer gra...
Michael A. Kowalski, Lee Markosian, J. D. Northrup...