213 search results - page 34 / 43 » Relating Word and Tree Automata |
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
COMPSAC
2002
IEEE
14 years 14 days ago
2002
IEEE
The paper aims at presenting a method of controlling software quality attributes driven by the set of requirements. This is done in three steps: specifying all the requirements, ma...
IANDC
2007
13 years 7 months ago
2007
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
IPL
2002
13 years 7 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...