Sciweavers

4488 search results - page 304 / 898
» Properties of NP-Complete Sets
Sort
View
DAM
2006
61views more  DAM 2006»
15 years 6 months ago
On error-tolerant DNA screening
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outco...
Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li
IJACT
2008
102views more  IJACT 2008»
15 years 6 months ago
An optimistic fair exchange protocol and its security in the universal composability framework
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto
IJDMMM
2008
87views more  IJDMMM 2008»
15 years 6 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier
FUIN
2006
64views more  FUIN 2006»
15 years 6 months ago
Injectivity of the Parikh Matrix Mappings Revisited
We deal with the notion of M-unambiguity [5] in connection with the Parikh matrix mapping introduced by Mateescu and others in [7]. M-unambiguity is studied both in terms of words ...
Virgil Nicolae Serbanuta, Traian-Florin Serbanuta
COMBINATORICS
2007
58views more  COMBINATORICS 2007»
15 years 6 months ago
The Initial Involution Patterns of Permutations
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
Dongsu Kim, Jang Soo Kim