نتایج جستجو برای: uniquely restricted matching

تعداد نتایج: 239904  

2012
Sayed Mohammad Ebrahim Sahraeian Byung-Jun Yoon

Here, we want to show that the proposed reduction scheme improves the expected accuracy of the querying result. Let A represent the space of all possible matchings between the query and the target networks, where a matching a uniquely maps the query nodes VQ to a subgraph region in the target network. Besides, let a∗ be the (unknown) matching from A that most nearly represents the true biologic...

Journal: :IEEE Trans. Signal Processing 1997
Georgios B. Giannakis Steven D. Halford

When the received data are fractionally sampled, the magnitude and phase of most linear time-invariant FIR communications channels can be estimated from second-order output-only statistics. We present a general cyclic correlation matching algorithm for known order FIR blind channel identification that has closed-form expressions for calculating the asymptotic variance of the channel estimates. ...

Journal: :Theor. Comput. Sci. 2014
Van Bang Le Florian Pfender

A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, max rainbow matching: Given an edge-colored graph G, how large is the largest rainbow matching in G? We present several sharp contrasts in the complexity of this problem. We show, among others, that • max rainbow matching can be approximated by a ...

Journal: :Communications in computer and information science 2021

There exist several methods for computing exact solutions of algebraic differential equations. Most the methods, however, do not ensure existence and uniqueness might fail after steps, or are restricted to linear The authors have presented in previous works a method overcome this problem autonomous first order ordinary equations formal Puiseux series solutions. In case, all can uniquely be repr...

Journal: :Discrete Applied Mathematics 1999
Krzysztof Giaro Marek Kubale Michal Malafiejski

Given a graph G, an edge-coloring or G with colors 1,2.3.. is consecutive if the colors of edges incident to each vertex fomm an interval of integer-s. This papelis devoted to bipartite graphs which do not have such a coloring of edges. We investigate their consecutive coloring deficiency, or shortly the deficiency d(G) of G, i.e. the minimum number of pendant edges whose attachment to G makes ...

2011
Alexa E. Hodge

According to Bradbury and Mather (2009), in the 2003-2004 academic school year 45% of new students enrolling in four-year institutions were first-generation students. When compared to continuing-generation college students, first-generation students have been shown to find the college going experience to be more stressful (Phinney & Haas, 2003). Despite the knowledge that these students find th...

2008
Christian Giguère Chantal Laroche Rida Al Osman Yun Zheng

Warning sounds are necessary to promptly alert workers of events that can compromise safety. A wide range of strategies, including verbal and non-verbal signals have been used in different environments (Edworthy & Adams 1996; Haas & Edworthy 2006; Edworthy & Hellier 2006). Unfortunately, the use of warning signals in industry is often submitted to intuitive installation practices with little re...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید