Sciweavers

419 search results - page 55 / 84
» Succincter
Sort
View
EDBT
2006
ACM
117views Database» more  EDBT 2006»
15 years 1 months ago
Model-Independent Schema and Data Translation
Abstract. We describe MIDST, an implementation of the model management operator ModelGen, which translates schemas from one model to another, for example from OO to SQL or from SQL...
Paolo Atzeni, Paolo Cappellari, Philip A. Bernstei...
85
Voted
FOIKS
2006
Springer
15 years 1 months ago
Modeling the Evolution of Objects in Temporal Information Systems
This paper presents a semantic foundation of temporal conceptual models used to design temporal information systems. We consider a modeling language able to express both timestampi...
Alessandro Artale, Christine Parent, Stefano Spacc...
SPIRE
2000
Springer
15 years 1 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, ...
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
15 years 1 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
LICS
1997
IEEE
15 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...