Results 251 to 260 of about 32,006,081 (306)

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

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

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

Strong representations of the Kaplan–Meier estimator and hazard estimator with censored widely orthant dependent data

Computational statistics (Zeitschrift), 2021
Yi Wu, Wei Yu, Xuejun Wang
semanticscholar   +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

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

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   +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

Incremental data dependence analysis

Proceedings of 3rd International Conference on High Performance Computing (HiPC), 2002
Under the existing framework for dependence analysis, every time a program is modified, exhaustive reanalysis has to be carried out to restructure the program. Often the changes in the program may be limited to a small portion. This may not affect a major part of the value based dependences.
K. V. Praveen, Sajeev Kumar Aggarwal, R. K. Ghosh   +2 more
openaire   +1 more source

Engineering a data dependence test

Concurrency: Practice and Experience, 1993
AbstractMany papers have been written dealing with the science of data dependence tests, particularly for dependence of arrays in loops; the techniques typically reduce the dependence problem to an algebraic problem, then solve the algebraic problem by an algorithm which has some desired blend of efficiency, generality or precision.
openaire   +1 more source