Results 221 to 230 of about 11,722 (261)
Some of the next articles are maybe not open access.
Commonalities for Preserving Consistency of Multiple Models
2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C), 2019Models are used to describe different properties of a software system. Those models often share information that is represented redundantly and, thus, has to be kept consistent. Defining model transformations between the involved metamodels is a common means to preserve the consistency of their instances.
Heiko Klare, Joshua Gleitze
openaire +2 more sources
Multiple view consistency for data warehousing
Proceedings 13th International Conference on Data Engineering, 2002A data warehouse stores integrated information from multiple distributed data sources. In effect, the warehouse stores materialized views over the source data. The problem of ensuring data consistency at the warehouse can be divided into two components: ensuring that each view reflects a consistent stare of the base data, and ensuring that multiple ...
Yue Zhuge +2 more
openaire +1 more source
From Multiple Images to a Consistent View
2001The approach presented in this paper allows a team of mobile robots to estimate cooperatively their poses, i.e. positions and orientations, and the poses of other observed objects from images. The images are obtained by calibrated color cameras mounted on the robots.
Robert Hanek +3 more
openaire +1 more source
Extended Multiple Descriptions with Reconstruction Consistency Constraints
2016 IEEE Globecom Workshops (GC Wkshps), 2016In the multiple descriptions (MD) problem with L channels, a decoder is said to be in Level α (1 ≤ α ≤ L) if it can access a subset of α encoders. We extend the MD problem by imposing an additional distortion criterion, called the subset distortion criterion, for each subset of reconstructions. The subset distortion criterion
Tao Guo 0003, Raymond W. Yeung
openaire +1 more source
Multiplicative consistency of linguistic preference relations with weakened hedges
Journal of Intelligent & Fuzzy Systems, 2022Preference relations are often used to derive the priority of attributes and/or alternatives. Linguistic term with weakened hedges (LTWH) as a type of complex linguistic expressions can more straightforwardly describe the linguistic information provided by DMs when evaluating under uncertainties.
Yao, Xuan, Wang, Hai, Xu, Zeshui
openaire +1 more source
Consistency checking for multiple view software architectures
ACM SIGSOFT Software Engineering Notes, 1999Consistency is a major issue that must be properly addressed when considering multiple view architectures. In this paper, we provide a formal definition of views expressed graphically using diagrams with multiplicities and propose a simple algorithm to check the consistency of diagrams.
Pascal Fradet +2 more
openaire +1 more source
SOME ISSUES ON MULTIPLICATIVE CONSISTENCY OF INTERVAL RECIPROCAL RELATIONS [PDF]
International Journal of Information Technology & Decision Making, 2011 Consistency plays an important part in decision making with interval reciprocal relation also called interval fuzzy preference relation. In this paper, we give the definition of perfect multiplicative consistent interval reciprocal relation and discuss its properties.
Meimei Xia, Zeshui Xu
openaire +2 more sources
Surface-consistent suppression of multiples
Geophysics, 1985Abstract A primary reflection from any layer located somewhere below a water bottom (Figure 1a) is accompanied on a seismic record by series of multiples whose raypaths include one or more extra reflections from a water bottom (Figure 1b) either at a shot and/or at a geophone location.
openaire +1 more source
On Using Consistency Consistently in Multiple Sequence Alignments
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2022Mario João Jr. +2 more
openaire +1 more source
Joint Optimization for Consistent Multiple Graph Matching
2013 IEEE International Conference on Computer Vision, 2013The problem of graph matching in general is NP-hard and approaches have been proposed for its sub optimal solution, most focusing on finding the one-to-one node mapping between two graphs. A more general and challenging problem arises when one aims to find consistent mappings across a number of graphs more than two.
Junchi Yan +5 more
openaire +1 more source