Sciweavers

50 search results - page 4 / 10
» Universal Succinct Representations of Trees
Sort
View
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 2 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
ATAL
2009
Springer
14 years 2 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge
FUIN
2008
99views more  FUIN 2008»
13 years 7 months ago
Universality Analysis for One-Clock Timed Automata
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
PPDP
2009
Springer
14 years 2 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
ICWS
2007
IEEE
13 years 9 months ago
Automated Choreographer Synthesis for Web Services Composition Using I/O Automata
We study the problem of synthesis of a choreogrpher in Web service composition for a given set of services and a goal. Services and goal are represented using i/o automata which c...
Saayan Mitra, Ratnesh Kumar, Samik Basu