Sciweavers

Share
PVLDB
2010
135views more  PVLDB 2010»
8 years 6 months ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
LICS
2010
IEEE
8 years 9 months ago
On the Expressivity of Symmetry in Event Structures
—This paper establishes a bridge between presheaf models for concurrency and the more operationally-informative world of event structures. It concentrates on a particular preshea...
Sam Staton, Glynn Winskel
ORDER
2006
97views more  ORDER 2006»
8 years 11 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
ORDER
2006
154views more  ORDER 2006»
8 years 11 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox
FUIN
2007
135views more  FUIN 2007»
8 years 11 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
ORDER
2008
91views more  ORDER 2008»
8 years 11 months ago
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
Manfred Droste, Robert Gray, John K. Truss
DAM
2007
100views more  DAM 2007»
8 years 11 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
CMS
2006
150views Communications» more  CMS 2006»
9 years 24 days ago
Attribute Delegation Based on Ontologies and Context Information
This paper presents a model for delegation based on partial orders, proposing the subclass relation in OWL as a way to represent the partial orders. Delegation and authorization de...
Isaac Agudo, Javier Lopez, José A. Monteneg...
AAAI
2008
9 years 1 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
CADE
1994
Springer
9 years 3 months ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
books