Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Bl...
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Variational data assimilation consists in estimating control parameters of a numerical model in order to minimize the misfit between the forecast values and some actual observatio...
Luigi Nardi, Charles Sorror, Fouad Badran, Sylvie ...
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...