697 search results - page 64 / 140 » Decomposition Structures for Event-B |
LISP
2002
14 years 11 months ago
2002
An algebra of pictures is described that is sufficiently powerful to denote the structure of a well-known Escher woodcut, Square Limit. A decomposition of the picture that is reaso...
ICIP
2004
IEEE
16 years 1 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
WCRE
2005
IEEE
15 years 5 months ago
2005
IEEE
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runt...
CSMR
2004
IEEE
15 years 3 months ago
2004
IEEE
The recovery of software architecture is a first important step towards re-engineering a software system. Architecture recovery usually involves clustering. The problem with curre...
CLEF
2009
Springer
15 years 29 days ago
2009
Springer
Abstract. In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be appl...