256 search results - page 35 / 52 » Short trees in polygons |
IWPC
2008
IEEE
14 years 3 months ago
2008
IEEE
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
CSB
2002
IEEE
14 years 1 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
ATVA
2006
Springer
14 years 11 days ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
VMV
2003
13 years 10 months ago
2003
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
IJFCS
2008
13 years 8 months ago
2008
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...