Sciweavers

5326 search results - page 264 / 1066
» On what we can ensure
Sort
View
JCS
1998
117views more  JCS 1998»
15 years 6 months ago
A Semantic-Based Transaction Processing Model for Multilevel Transactions
Multilevel transactions have been proposed for multilevel secure databases; in contrast to most proposals, such transactions allow users to read and write across multiple security...
Indrakshi Ray, Paul Ammann, Sushil Jajodia
DAGSTUHL
2006
15 years 8 months ago
New tricks from an old dog: An overview of TEI P5
This paper presents an update on the current state of development of the Text Encoding Initiative's Guidelines for Electronic Text Encoding and Interchange. Since the last ma...
Lou Burnard
NDJFL
1998
105views more  NDJFL 1998»
15 years 6 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
ICML
2003
IEEE
16 years 7 months ago
Probabilistic Classifiers and the Concepts They Recognize
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...
Manfred Jaeger
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
16 years 1 months ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos