Associative models for storing and retrieving concept lattices.
Attribute-oriented defuzzification of fuzzy database tuples with categorical entries
Average case analysis of fully dynamic reachability for directed graphs
Bounds for on-line selection
Bringing introspection into BlobSeer: Towards a self-adaptive distributed data management system
Introspection is the prerequisite of autonomic behavior, the first step towards performance improvement and resource usage optimization for large-scale distributed systems. In grid environments, the task of observing the application behavior is assigned to monitoring systems. However, most of them are designed to provide general resource information and do not consider specific information for higher-level services. More precisely, in the context of data-intensive applications, a specific introspection...
BUDI: Architecture for Fuzzy Search in Documental Repositories.
Building representative-based data aggregation tree in wireless sensor networks.
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Catalogues, treillis de catalogues, génération et décomposition
Categorical abstract data type (CADT)
Categorical data-specifications.
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Chaotic image encryption design using Tompkins-Paige algorithm.
Characterisations of ideal threshold schemes.
Characteristic sets of a system of equivalence relations
Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear code functions....
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear code functions. The...
CLAS - A Formal Aid to Data Elements Identification
Clustering techniques for adaptive horizontal fragmentation in object oriented databases.
Codes that attain minimum distance in every possible direction
The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.