نتایج جستجو برای: generalized kannan
تعداد نتایج: 166212 فیلتر نتایج به سال:
Farach, Kannan and Warnow (1995) have defined Problem MCA (matrix completion to additive) and proved it to be NP-complete: given a partial dissimilarity d on a finite set X , does there exist a tree metric extending d to all pairs of elements of X . We use a previously described simple method of phylogenetic reconstruction, and its extension to partial dissimilarities, to characterize some clas...
Farach, Kannan and Warnow (1995) defined Problem MCA (matrix completion to additive) and proved it to be NP-complete: given a partial dissimilarity d on a finite set X, does there exist a tree metric extending d to all pairs of elements of X. We use a previously described simple method of phylogenetic reconstruction, and its extension to partial dissimilarities, to characterize some classes of ...
Mahakavi Bharathiyar’s songs marks the turning point in world of Tamil literature. Although there are many innovations his works, he has never left old and ancient tradition behind. He puts forward thoughts, needs, expectations prayers through devotional about Lord Ganesha, Muruga, Lakshmi, Saraswati, Kali, Muthumari, Govindan, Shakti, Omshakti, Parashakti Kannan. Among poems written by Bharath...
The Frieze-Kannan regularity lemma is a powerful tool in combinatorics. It has also found applications in the design of approximation algorithms and recently in the design of fast combinatorial algorithms for boolean matrix multiplication. The algorithmic applications of this lemma require one to efficiently construct a partition satisfying the conditions of the lemma. Williams [25] recently as...
We consider, in the setting of convex metric spaces, a new class of Kannan type cyclic orbital contractions, and study the existence of its best proximity points. The same problem is then discussed for relatively Kannan nonexpansive mappings, by using the concept of proximal quasinormal structure. In this way, we extend the main results in Abkar and Gabeleh [A. Abkar and M. Gabeleh, J. Nonlin. ...
The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since more than tw...
Recently, José R. Morales and Edixon Rojas [José R. Morales and Edixon Rojas, Cone metric spaces and fixed point theorems of T -Kannan contractive mappings, Int. J. Math. Anal. 4 (4) (2010) 175–184] proved fixed point theorems for T -Kannan and T -Chatterjea contractions in conemetric spaces when the underlying cone is normal. The aim of this paper is to prove this without using the normality c...
Fabrication, Physicochemical Characterization and Evaluation of In vitro Anticancer Efficacy a Novel pH Sensitive Polymeric Nanoparticles for Efficient Delivery Hydrophobic Drug against Colon CancerManikandan Mahalingam, Kannan Krishnamoorthy
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید