Results 31 to 40 of about 7,423,432 (277)
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
Journal of Graph Algorithms and Applications, 2018 Circle graphs have applications to RNA bioinformatics, computational chemistry, and VLSI design. Additionally, many problems that are intractable on general graphs are efficient for circle graphs.
Max Ward +3 more
doaj +1 more source
Strong anticipation: complexity matching in interpersonal coordination [PDF]
Experimental Brain Research, 2012 A subtle coordination occurs within complex systems, between multiple nested sub-systems. This intra-system coordination can be detected by the presence of 1/f fluctuations produced by the system. But coordination can occur also between systems. Interpersonal coordination has been studied from a local point of view until now, focusing on macroscopic ...
Vivien, Marmelat, Didier, Delignières
openaire +2 more sources
Strong Anticipation: Complexity Matching in Interpersonal Coordination
BIO Web of Conferences, 2011 Anticipation in sensori-motor synchronization tasks is often attributed to the presence of internal model based on situation regularities. However this interpretation seems unable to explain the synchronization of an organism with a complex environment ...
Delignières Didier +2 more
doaj +1 more source
Fractional strong matching preclusion for two variants of hypercubes
Theory and Applications of Graphs, 2019 Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G.
Huifen Ge +3 more
doaj +1 more source
The Plumb-Line Matching Algorithm for UAV Oblique Photographic Photos
Remote Sensing, 2023 Building facades has always been a challenge for feature matching in oblique photogrammetry due to weak textures, non-Lambertian objects, severe occlusion, and distortion.
Xinnai Zhang +4 more
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The 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.
Xia Wang +4 more
doaj +1 more source
Universal Information Extraction as Unified Semantic Matching [PDF]
AAAI Conference on Artificial Intelligence, 2023 The challenge of information extraction (IE) lies in the diversity of label schemas and the heterogeneity of structures. Traditional methods require task-specific model design and rely heavily on expensive supervision, making them difficult to generalize
Jie Lou +7 more
semanticscholar +1 more source
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Olivier Togni
doaj +1 more source
Optimum Design of Transmit Coil for Inductively Coupled Power Transfer System
Journal of Harbin University of Science and Technology, 2020 In order to improve the transfer efficiency of the wireless power transfer system，the matching given parameters is proposed. First of all，the equivalent model of PS single-tube inverter ICPT system is established，which transform the problem of transfer ...
LENG Shi-chuan +3 more
doaj +1 more source
Fraud Firms and the Matching Principle: Evidence from Korea
Gadjah Mada International Journal of Business, 2014 This paper examines whether the degree of matching for poor-performing fraud firms varies depending on the strength of the causal relation between expenses and revenues.
Jooyeon Hong +1 more
doaj +1 more source