Sciweavers

2189 search results - page 207 / 438
» A Graded Applicability of Rules
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 10 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
VLDB
2003
ACM
160views Database» more  VLDB 2003»
14 years 10 months ago
Composing Web services on the Semantic Web
Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexibl...
Brahim Medjahed, Athman Bouguettaya, Ahmed K. Elma...
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 9 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
SADFE
2008
IEEE
14 years 4 months ago
Finding the Evidence in Tamper-Evident Logs
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity en...
Daniel Sandler, Kyle Derr, Scott A. Crosby, Dan S....
RR
2007
Springer
14 years 3 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...