Sciweavers

917 search results - page 19 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ASM
2008
ASM
13 years 9 months ago
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
Abstract. The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical ver...
Gerhard Schellhorn, Richard Banach
BMCBI
2004
154views more  BMCBI 2004»
13 years 7 months ago
Computation of elementary modes: a unifying framework and the new binary approach
Background: Metabolic pathway analysis has been recognized as a central approach to the structural analysis of metabolic networks. The concept of elementary (flux) modes provides ...
Julien Gagneur, Steffen Klamt
CVPR
2003
IEEE
14 years 9 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
SCM
2003
13 years 9 months ago
Merging Collection Data Structures in a Content Management System
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
Axel Wienberg
CIDM
2009
IEEE
13 years 11 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...