Results 271 to 280 of about 34,984,246 (316)
Some of the next articles are maybe not open access.

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

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   +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   +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   +2 more
openaire   +1 more source

Data Dependence in Combining Classifiers

2003
It has been accepted that multiple classifier systems provide a platform for not only performance improvement, but more efficient and robust pattern classification systems. A variety of combining methods have been proposed in the literature and some work has focused on comparing and categorizing these approaches.
Mohamed S. Kamel, Nayer M. Wanas
openaire   +2 more sources

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

Recognition of functional dependencies in data

1993
Discovery of regularities in data involves search in many spaces, for instance in the space of functional expressions. If data do not fit any solution in a particular space, much time could be saved if that space was not searched at all. A test which determines the existence of a solution in a particular space, if available, can prevent unneeded search.
Robert Zembowicz, Jan M. Zytkow
openaire   +1 more source

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

Home - About - Disclaimer - Privacy