Results 21 to 30 of about 7,423,432 (277)
Iterative Geometry Encoding Volume for Stereo Matching [PDF]
Recurrent All-Pairs Field Transforms (RAFT) has shown great potentials in matching tasks. However, all-pairs correlations lack non-local geometry knowledge and have difficulties tackling local ambiguities in ill-posed regions.
Gangwei Xu +3 more
semanticscholar +1 more source
Strong edge-colouring and induced matchings [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hervé Hocquard +2 more
openaire +1 more source
Different Sourcing Point of Interest Matching Method Considering Multiple Constraints
Point of interest (POI) matching is critical but is the most technically difficult part of multi-source POI fusion. The accurate matching of POIs from different sources is important for the effective reuse of POI data.
Chengming Li +3 more
doaj +1 more source
An Anti-Wing Flexure Velocity+Attitude Matching Rapid Transfer Alignment Algorithm [PDF]
In order to improve the transfer alignment speed and accuracy of airborne missile strapdown inertial navigation system under strong interference, an improved rapid transfer alignment algorithm is designed, which can adapt to the strong flexure and ...
Cheng Haibin,Lu Hao,Wang Jinda
doaj +1 more source
Fractional matching preclusion for generalized augmented cubes [PDF]
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source
A new cross-modal image matching method is proposed to solve the problem that unmanned aerial vehicles (UAVs) are difficult to navigate in GPS-free environment and night environment.
Songlai Han +4 more
doaj +1 more source
Map matching for intelligent speed adaptation [PDF]
Udgivelsesdato ...
Tradisauskas, Nerius +3 more
openaire +2 more sources
Matcha-TTS: A Fast TTS Architecture with Conditional Flow Matching [PDF]
We introduce Matcha-TTS, a new encoder-decoder architecture for speedy TTS acoustic modelling, trained using optimal-transport conditional flow matching (OT-CFM).
Shivam Mehta +4 more
semanticscholar +1 more source
Graph pattern matching is finding all matches in a data graph for a given pattern graph and is often defined in terms of subgraph isomorphism, an NP -complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Shuai Ma 0001 +4 more
openaire +3 more sources
Strong and weighted matchings in inhomogenous random graphs [PDF]
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that end-vertices of any two distinct edges are at least a minimum distance apart.
openaire +3 more sources

