Sciweavers

241 search results - page 18 / 49
» Relational preference rules for control
Sort
View
IAJIT
2010
157views more  IAJIT 2010»
13 years 6 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Database
: Privacy is one of the most important properties of an information system must satisfy, in which systems the need to share information among different, not trusted entities, the p...
Ashraf El-Sisi
AAAI
2006
13 years 9 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
JANCL
2007
106views more  JANCL 2007»
13 years 7 months ago
Dynamic logic for belief revision
ABSTRACT. We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consist...
Johan van Benthem
ACL
1990
13 years 8 months ago
Mixed Initiative in Dialogue: An Investigation into Discourse Segmentation
Conversation between two people is usually of MIXED-INITIATIVE, with CONTROL over the conversation being transferred from one person to another. We apply a set of rules for the tr...
Marilyn A. Walker, Steve Whittaker
ENTCS
2007
128views more  ENTCS 2007»
13 years 7 months ago
Rewriting-Based Access Control Policies
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
Anderson Santana de Oliveira