4502 search results - page 753 / 901 » Regular Model Checking |
179
click to vote
CICLING
2007
Springer
16 years 27 days ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
191
click to vote
ESAS
2007
Springer
16 years 27 days ago
2007
Springer
Responding to misbehavior in ad-hoc and sensor networks is difficult. We propose new techniques for deciding when to remove nodes in a decentralized manner. Rather than blackballin...
172
Voted
FROCOS
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
203
Voted
ISBRA
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Cancer detection using mammography focuses on characteristics of tiny microcalcifications, including the number, size, and spatial arrangement of microcalcification clu...
185
Voted
SCIA
2007
Springer
16 years 25 days ago
2007
Springer
Two deformable registration methods, the Demons and the Morphon algorithms, have been used for registration of CT datasets to evaluate their usability in radiotherapy planning for ...