Results 241 to 250 of about 9,847,496 (288)

A Proof Procedure for Data Dependencies

Journal of the ACM, 1984
A class of dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependencies. For total dependencies the chase is an exponential time decision procedure for the implication problem, and in some restricted cases it can be modified to run in polynomial time.
Catriel Beeri, Moshe Y. Vardi
openaire   +1 more source

Fragmentation in Presence of Data Dependencies

IEEE Transactions on Dependable and Secure Computing, 2014
Fragmentation has been recently proposed as a promising approach to protect the confidentiality of sensitive associations whenever data need to undergo external release or storage. By splitting attributes among different fragments, fragmentation guarantees confidentiality of the associations among these attributes under the assumption that such ...
Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Giovanni Livraga, Stefano Paraboschi, Pierangela Samarati   +5 more
openaire   +3 more sources

Fuzzy data dependencies and implication of fuzzy data dependencies

Fuzzy Sets and Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Contexts and Data Dependencies: A Synthesis

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
Two data-organization devices that have come out of AI re-search are data pools (``contexts'') and data dependencies. The latter are more flexible than the former, and have supplanted them. Data pools offer certain advantages of efficiency, however, so it is worth trying to make the two mechanisms compatible.
openaire   +2 more sources

Effectiveness of data dependence analysis

International Journal of Parallel Programming, 1995
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs. The problem is undecidable in the general case. Therefore, work has been concentrated on a simplified problem, affine memory disambiguation. In this simpler domain, array references and loops bounds are assumed to be linear integer functions of loop ...
Dror E. Maydan, John L. Hennessy, Monica S. Lam   +2 more
openaire   +1 more source

Effects of pointers on data dependences

Proceedings 9th International Workshop on Program Comprehension. IWPC 2001, 2002
This paper presents a technique for computing and classifying data dependences that takes into account the complexities introduced by specific language constructs, such as pointers, arrays and structures. The classification is finer-grained than previously proposed classifications.
Orso, Alessandro, Sinha, Saurabh, Harrold, Mary Jean   +2 more
openaire   +1 more source

Dependence in sensory data combination

Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), 2002
It is common to assume sensor independence in the sensory data fusion and integration. The authors previously (1997, 1998) illustrated that the team consensus approach based on information entropy can remarkably improve the measurement accuracy. The major benefits of the approach are (a) the simple linear combination of the weighted initial expected ...
Albert C. S. Chung, Helen C. Shen
openaire   +1 more source

Rough Sets and Data Dependencies

1994
Many methods have been used to express the relationships between different pieces of data. In the beginning, all relationships were assumed to be rigid and precise. Objects were either in a set or they were not. All data followed a rule or was incorrect.
Debby Keen, Arcot Rajasekar
openaire   +1 more source

On the expressive power of data dependencies

Acta Informatica, 1986
Since the language of data dependencies is a language for semantic specification of databases, it is highly desirable to know which classes of databases are axiomatizable by different kinds of data dependencies. As a decisive step towards a comprehensive theory, the paper under review gives characterizations of axiomatizability of (finite) databases by
Johann A. Makowsky, Moshe Y. Vardi
openaire   +2 more sources

Graphs of Data Flow Dependencies

IFAC Proceedings Volumes, 1979
Data flow dependencies of a program are important for code-optimisation of compilers and for detecting errors in programs. The control flow of a program can be described by its control flow graph. The mutual dependencies of variables in a program can be represented by graphs, too.
openaire   +1 more source