Sciweavers

18209 search results - page 366 / 3642
» Some Remarks on the Paper
Sort
View
IJNSEC
2008
106views more  IJNSEC 2008»
15 years 6 months ago
Comments on "Improved Efficient Remote User Authentication Schemes"
Recently, Tian et al. presented an article, in which they discussed some security weaknesses of Yoon et al.'s scheme and subsequently proposed two "improved" scheme...
Manik Lal Das
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
15 years 6 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
On Self-Complementary Cyclic Packing of Forests
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
IJCSA
2006
133views more  IJCSA 2006»
15 years 6 months ago
Implementations of Web-based Recommender Systems Using Hybrid Methods
Application of hybrid recommendation enables overcoming disadvantages of the basic recommendation methods: demographic, collaborative and content-based. In this paper the two cons...
Janusz Sobecki
JCT
2008
120views more  JCT 2008»
15 years 6 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau