Sciweavers

696 search results - page 32 / 140
» A class of combinatorial identities
Sort
View
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 2 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
ICTAC
2004
Springer
15 years 7 months ago
Object Connectivity and Full Abstraction for a Concurrent Calculus of Classes
onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...
Erika Ábrahám, Marcello M. Bonsangue...
ASE
2007
143views more  ASE 2007»
15 years 2 months ago
Composition inference for UML class diagrams
Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the ga...
Ana Milanova
CONCUR
2007
Springer
15 years 8 months ago
Rule-Based Modelling of Cellular Signalling
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
Vincent Danos, Jérôme Feret, Walter F...
STACS
2007
Springer
15 years 8 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer