Results 31 to 40 of about 1,383,780 (316)
Semantic Matching with S-Match [PDF]
, 2009 We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies) and produces an alignment between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover an alignment by computing semantic relations (e.g., equivalence, more general); (ii) we ...
Shvaiko, Pavel +2 more
openaire +2 more sources
A Robust Linear Feature-Based Procedure for Automated Registration of Point Clouds
Sensors, 2015 With the variety of measurement techniques available on the market today, fusing multi-source complementary information into one dataset is a matter of great interest. Target-based, point-based and feature-based methods are some of the approaches used to
Martyna Poreba, François Goulette
doaj +1 more source
Advanced compact modeling of the deep submicron technologies
Journal of Telecommunications and Information Technology, 2000 The technology of CMOS large-scale integrated circuits (LSI`s) achieved remarkable advances over last 25 year and the progress is expected to continue well into the next century.
Władysław Grabiński +3 more
doaj +1 more source
Education Match and Job Match [PDF]
The Review of Economics and Statistics, 1991 Using a new data set, this paper gives evidence in support of the intuitive notion that overqualified workers are less satisfied with their jobs and are more likely to quit. However, training time is inversely related to overqualification, which suggests why such seeming mismatches occur and may in fact be optimal. Copyright 1991 by MIT Press.
openaire +1 more source
On Matchings in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all $k$-subsets which intersect a given set of $s$ vertices.
Peter Frankl +2 more
openaire +3 more sources
TEEDA: An Interactive Platform for Matching Data Providers and Users in the Data Marketplace
Information, 2020 Improvements in Web platforms for data exchange and trading are creating more opportunities for users to obtain data from data providers of different domains.
Teruaki Hayashi, Yukio Ohsawa
doaj +1 more source
The ecological connectivity of whale shark aggregations in the Indian Ocean: a photo-identification approach [PDF]
Royal Society Open Science, 2016 Genetic and modelling studies suggest that seasonal aggregations of whale sharks (Rhincodon typus) at coastal sites in the tropics may be linked by migration.
Samantha Andrzejaczek +6 more
doaj +1 more source
Semiglobal Matching Results on the ISPRS Stereo Matching Benchmark [PDF]
, 2011 Digital surface models can be efficiently generated with automatic image matching from optical stereo images. The Working Group 4 of Commission I on "Geometric and Radiometric Modelling of Optical Spaceborne Sensors" provides a matching benchmark ...
Reinartz, Peter +3 more
core +2 more sources
A Distributed and Context-Aware Task Assignment Mechanism for Collaborative Mobile Edge Computing
Sensors, 2018 Mobile edge computing (MEC) is an emerging technology that leverages computing, storage, and network resources deployed at the proximity of users to offload their delay-sensitive tasks.
Bo Gu +4 more
doaj +1 more source
Multi-Level Features Extraction for Discontinuous Target Tracking in Remote Sensing Image Monitoring
Sensors, 2019 Many techniques have been developed for computer vision in the past years. Features extraction and matching are the basis of many high-level applications.
Bin Zhou +6 more
doaj +1 more source