Blossom algorithm
View article
Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing Open
Mobile edge computing (MEC) and non-orthogonal multiple access (NOMA) have been considered as the promising techniques to address the explosively growing computation-intensive applications and accomplish the requirement of massive connecti…
View article
Matching-Based Task Offloading for Vehicular Edge Computing Open
Vehicular edge computing has emerged as a promising technology to accommodate the tremendous demand for data storage and computational resources in vehicular networks. By processing the massive workload tasks in the proximity of vehicles, …
View article
Social Network-Based Content Delivery in Device-to-Device Underlay Cellular Networks Using Matching Theory Open
With the popularity of social network-based services, the unprecedented growth of mobile date traffic has brought a heavy burden on the traditional cellular networks. Device-to-device (D2D) communication, as a promising solution to overcom…
View article
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources Open
Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a kn…
View article
Energy Disaggregation of Appliances Consumptions Using HAM Approach Open
Non-intrusive load monitoring (NILM) makes it possible for users to track the energy consumption of a household. In this paper, we present a new hybrid energy disaggregation approach named HAM. This event-based load disaggregation algorith…
View article
A Matching Algorithm for Dynamic Ridesharing Open
Ridesharing is an important component of sustainable urban transportation as it increases vehicle utilization while reducing road utilization. By sharing rides, drivers offer free seats in their vehicles to passengers who want to travel in…
View article
Overview of Image Matching Based on ORB Algorithm Open
ORB image matching is of great significance in the field of image processing, which is mainly used in navigation, target recognition and classification, image stitching and remote sensing registration. Based on the existing literature on O…
View article
Dynamic Resource Allocation for Optimized Latency and Reliability in Vehicular Networks Open
Supporting ultra-reliable and low-latency communications (URLLC) is crucial for vehicular traffic safety and other mission-critical applications. In this paper, a novel proximity and quality-ofservice-aware resource allocation framework fo…
View article
FIRST Open
Attributed subgraph matching is a powerful tool for explorative mining of large attributed networks. In many applications (e.g., network science of teams, intelligence analysis, finance informatics), the user might not know what exactly s/…
View article
Resource allocation for V2X communications: A local search based 3D matching approach Open
Vehicle-to-everything (V2X) communications, en- abled by cellular device-to-device (D2D) links, have recently drawn much attention due to its potential to improve traffic safety, efficiency, and comfort. In this context, however, intracell…
View article
High-Precision Measurement of Binocular Telecentric Vision System With Novel Calibration and Matching Methods Open
In stereo vision-based three-dimensional measurements, calibration, and stereo matching are the most challenging tasks for accurate three-dimensional reconstruction. The traditional binocular vision algorithm has low precision, and we prop…
View article
A Personalized Matching System for Management Teaching Resources Based on Collaborative Filtering Algorithm Open
To realize education informatization, it is highly necessary to recommend teaching resources to students that can enhance their learning interest and improve teaching quality. This paper develops a personalized matching system for manageme…
View article
Low Rank Spectral Network Alignment Open
Network alignment or graph matching is the classic problem of finding matching vertices between two graphs with applications in network de-anonymization and bioinformatics. There exist a wide variety of algorithms for it, but a challenging…
View article
Fast De-anonymization of Social Networks with Structural Information Open
Ever since the social networks became the focus of a great number of researches, the privacy risks of published network data have also raised considerable concerns. To evaluate users’ privacy risks, researchers have developed methods to de…
View article
Remote Sensing Image Matching Based Improved ORB in NSCT Domain Open
Aiming at the problem that the ORB algorithm has no scale invariance and low matching accuracy in image matching, an improved ORB algorithm is proposed on the basis of SURF algorithm. Based on the flexibility of NSCT in image decomposition…
View article
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources Open
Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a kn…
View article
The Stochastic Matching Problem with (Very) Few Queries Open
Motivated by an application in kidney exchange, we study the following stochastic matching problem: we are given a graph G(V,E) (not necessarily bipartite), where each edge in E is realized with some constant probability p > 0 and the goal…
View article
Improved Multiple Matching Method for Observing Glacier Motion With Repeat Image Feature Tracking Open
Repeat Image Feature Tracking (RIFT) is commonly used to measure glacier surface motion from pairs of images, most often utilizing normalized cross correlation (NCC). The Multiple-Image Multiple-Chip (MIMC) algorithm successfully employed …
View article
QoE-Aware Downlink User-Cell Association in Small Cell Networks: A Transfer-matching Game Theoretic Solution With Peer Effects Open
The user-cell association mechanism is one of the important research topics for radio resource management in heterogeneous wireless networks. Existing studies mainly concerned the physical performance such as throughput and SINR, and ignor…
View article
Tight competitive ratios of classic matching algorithms in the fully online model Open
Huang et al. (STOC 2018) introduced the fully online matching problem, a generalization of the classic online bipartite matching problem in that it allows all vertices to arrive online and considers general graphs. They showed that the ran…
View article
An Improved FAST+SURF Fast Matching Algorithm Open
Target matching is an important part of image registration and mosaic. Based on a lot of real-time application requirements, the requirement of fast matching is also put forward. The classical matching algorithm has the problems of large c…
View article
Energy Disaggregation Using Elastic Matching Algorithms Open
In this article an energy disaggregation architecture using elastic matching algorithms is presented. The architecture uses a database of reference energy consumption signatures and compares them with incoming energy consumption frames usi…
View article
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model Open
Huang et al. (STOC 2018) introduced the fully online matching problem, a generalization of the classic online bipartite matching problem in that it allows all vertices to arrive online and considers general graphs. They showed that the ran…
View article
A Miniature Binocular Endoscope with Local Feature Matching and Stereo Matching for 3D Measurement and 3D Reconstruction Open
As the traditional single camera endoscope can only provide clear images without 3D measurement and 3D reconstruction, a miniature binocular endoscope based on the principle of binocular stereoscopic vision to implement 3D measurement and …
View article
Endoscope localization and gastrointestinal feature map construction based on monocular SLAM technology Open
Aiming at the real intestinal environment, the commonly used feature extraction algorithms are compared and analyzed. The performances of SIFT, BRISK, ORB and FREAK are evaluated from three aspects: feature extraction time, correct matchin…
View article
Research on Image Matching of Improved SIFT Algorithm Based on Stability Factor and Feature Descriptor Simplification Open
In view of the problems of long matching time and the high-dimension and high-matching rate errors of traditional scale-invariant feature transformation (SIFT) feature descriptors, this paper proposes an improved SIFT algorithm with an add…
View article
An Efficient Multilinear Optimization Framework for Hypergraph Matching Open
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows the use of higher-order geometric information. Hypergraph matching can be formulated as a third-order optimizati…
View article
An Improved Stereo Matching Algorithm Based on Joint Similarity Measure and Adaptive Weights Open
Stereo matching is the operation of obtaining the parallax value between two images by matching all the corresponding image points in the two images, thus obtaining the dense parallax image between the two images. How to obtain accurate di…
View article
[Retracted] Design and Simulation of Human Resource Allocation Model Based on Double‐Cycle Neural Network Open
The rationalization of human resource management is helpful for enterprises to efficiently train talents in the field, improve the management mode, and increase the overall resource utilization rate of enterprises. The current computationa…
View article
Popular Matchings and Limits to Tractability Open
We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant …