Sciweavers

1632 search results - page 123 / 327
» Topological Analysis of Refinement
Sort
View
SAS
2000
Springer
15 years 2 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne
DGO
2008
99views Education» more  DGO 2008»
15 years 15 days ago
Specifying and verifying requirements for election processes
In this paper we outline an approach for modeling election processes and then performing rigorous analysis to verify that these process models meet selected behavioral requirement...
Borislava I. Simidchieva, Matthew Marzilli, Lori A...
DC
2001
15 years 13 days ago
A Metadata Case Study for the FRBR Model Based on Chinese Painting and Calligraphy at the National Palace Museum in Taipei
In 1998, the Functional Requirements for Bibliographic Records FRBR model which is composed by four entities work, expression, manifestation and item and their associative relatio...
Simon C. Lin, Ya-ning Chen, Shu-jiun Chen, Yi-ting...
CVIU
2008
75views more  CVIU 2008»
14 years 11 months ago
Performance characterization in computer vision: A guide to best practices
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have b...
Neil A. Thacker, Adrian F. Clark, John L. Barron, ...
98
Voted
ENTCS
2010
82views more  ENTCS 2010»
14 years 11 months ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...