نتایج جستجو برای: pairwise non

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

Journal: :IEEE Trans. Communications 2002
Jürgen Häring A. J. Han Vinck

The transmission over the memoryless additive white Class-A noise (AWCN) channel is considered. For uncoded transmission, an exact expression for the symbol error rate is derived. For coded transmission, the Chernoff bound on the pairwise error probability is calculated and the performance achieved on the real and the complex AWCN channels is compared. Moreover, a lowcomplexity, suboptimum deco...

BACKGROUND AND AIM: The prevalence of tobacco use and its associated mortality is increasing worldwide. Biomarkers in saliva, such as thiocyanate levels, have been shown to be a suitable indicator for smoking. The present study is conducted to determine the thiocyanate levels in saliva and compare them among tobacco (smoking and smokeless) users, passive smoker...

1997
R. A. MATHON

It is proved that there are precisely 4204 pairwise non-isomorphic Steiner systems S(5, 6, 72) invariant under the group PSL2(71) and which can be constructed using only short orbits. It is further proved that there are precisely 38717 pairwise non-isomorphic Steiner systems S(5, 6, 84) invariant under the group PSL2(83) and which can be constructed using only short orbits.

ژورنال: پژوهش های ریاضی 2022

The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...

2013
Neill D. F. Campbell Kartic Subr Jan Kautz

Conditional Random Fields (CRFs) are used for diverse tasks, ranging from image denoising to object recognition. For images, they are commonly defined as a graph with nodes corresponding to individual pixels and pairwise links that connect nodes to their immediate neighbors. Recent work has shown that fully-connected CRFs, where each node is connected to every other node, can be solved efficien...

Journal: :Ad Hoc Networks 2007
Zhenjiang Li J. J. Garcia-Luna-Aceves

We present a new non-interactive key agreement and progression (NIKAP) scheme for mobile ad hoc networks (MANETs), which does not require an on-line centralized authority, can non-interactively establish and update pairwise keys between nodes, is configurable to operate synchronously or asynchronously, and supports differentiated security services w.r.t. the given security policies. NIKAP is va...

The concept of  somewhat pairwise fuzzy $alpha$-irresolute continuous mappings and somewhat pairwise fuzzy irresolute $alpha$-open mappings have been introduced and studied. Besides, some interesting properties of those mappings are given.

Journal: :Int. J. Machine Learning & Cybernetics 2012
Changyou Chen Junping Zhang Xuefang He Zhi-Hua Zhou

For existing kernel learning based semi-supervised clustering algorithms, it is generally difficult to scale well with large scale datasets and robust pairwise constraints. In this paper, we proposed a new Non-Parametric Kernel Learning framework (NPKL) to deal with these problems. We generalized the graph embedding framework into kernel learning, by reforming it as a semi-definitive programmin...

2011
Mohamed El Yazid Boudaren Emmanuel Monfrini Wojciech Pieczynski

Hidden Markov chains (HMCs) have been extensively used to solve a wide range of problems related to computer vision, signal processing (Cappé, O., et al 2005) or bioinformatics (Koski, T., 2001). Such notoriety is due to their ability to recover the hidden data of interest using the entire observable signal thanks to some Bayesian techniques like MPM and MAP. HMCs have then been generalized to ...

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

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