Sciweavers

331 search results - page 36 / 67
» Abstract Interpretation of Graph Transformation
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
FGCS
2000
96views more  FGCS 2000»
14 years 9 months ago
Logicflow execution model for parallel databases
The LOGFLOW parallel Prolog system is similar to the recent parallel database systems concerning its dataflow execution model and its capability of running on othing architectures...
Péter Kacsuk, Norbert Podhorszki
EJC
2007
14 years 9 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
ADBIS
2009
Springer
151views Database» more  ADBIS 2009»
15 years 4 months ago
Rule-Based Management of Schema Changes at ETL Sources
In this paper, we visit the problem of the management of inconsistencies emerging on ETL processes as results of evolution operations g at their sources. We abstract Extract-Transf...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
ASWEC
2005
IEEE
15 years 3 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...