Sciweavers

551 search results - page 39 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
15 years 6 days ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
POPL
2004
ACM
14 years 11 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
SIGIR
2009
ACM
14 years 5 months ago
The ESA retrieval model revisited
Among the retrieval models that have been proposed in the last years, the ESA model of Gabrilovich and Markovitch received much attention. The authors report on a significant imp...
Maik Anderka, Benno Stein
ER
2007
Springer
125views Database» more  ER 2007»
14 years 5 months ago
On the Correlation between Process Model Metrics and Errors
Business process models play an important role for the management, design, and improvement of process organizations and process-aware information systems. Despite the extensive ap...
Jan Mendling, Gustaf Neumann, Wil M. P. van der Aa...
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
14 years 18 days ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf