Sciweavers

685 search results - page 8 / 137
» Closure Operators for Order Structures
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 8 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
89
Voted
COLING
1992
15 years 3 months ago
Disjunctive Feature Structures As Hypergraphs
Abstract -- In this paper, we present a new mathematical framework in which disjunctive feature structures are defined as directed acyclic hypergraphs. Disjunction is defined in th...
Jean Véronis
PLDI
1995
ACM
15 years 5 months ago
Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
Alexander Aiken, Manuel Fähndrich, Raph Levie...
JSYML
2002
170views more  JSYML 2002»
15 years 2 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
CCS
2007
ACM
15 years 8 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder