Sciweavers

Share
ACTA
2008
88views more  ACTA 2008»
9 years 9 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
ACTA
2007
88views more  ACTA 2007»
9 years 10 months ago
Distributed Consensus, revisited
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
Rachele Fuzzati, Massimo Merro, Uwe Nestmann
ACTA
2007
85views more  ACTA 2007»
9 years 10 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
ACTA
2007
96views more  ACTA 2007»
9 years 10 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
ACTA
2007
92views more  ACTA 2007»
9 years 10 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
ACTA
2007
114views more  ACTA 2007»
9 years 10 months ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
ACTA
2007
90views more  ACTA 2007»
9 years 10 months ago
Well-structured languages
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
Gilles Geeraerts, Jean-François Raskin, Lau...
ACTA
2007
126views more  ACTA 2007»
9 years 10 months ago
The syntactic monoid of hairpin-free languages
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
Lila Kari, Kalpana Mahalingam, Gabriel Thierrin
ACTA
2007
56views more  ACTA 2007»
9 years 10 months ago
On the equivalence between FDs in XML and FDs in relations
Millist W. Vincent, Jixue Liu, Mukesh K. Mohania
ACTA
2007
104views more  ACTA 2007»
9 years 10 months ago
Decision problems for pushdown threads
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, an...
Jan A. Bergstra, Inge Bethke, Alban Ponse
books