70 search results - page 9 / 14 » (U, N)-Implications and Their Characterizations |
AGP
1998
IEEE
13 years 12 months ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
DM
2002
13 years 7 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
DAM
2011
13 years 2 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
SP
2008
IEEE
14 years 2 months ago
2008
IEEE
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...