Sciweavers

471 search results - page 11 / 95
» Single-peaked consistency and its complexity
Sort
View
OTM
2005
Springer
14 years 1 months ago
Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
Yuan An, Alexander Borgida, John Mylopoulos
DGCI
2006
Springer
13 years 11 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
CAAN
2004
Springer
14 years 28 days ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
OPODIS
2008
13 years 9 months ago
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of events, each of which consists of simultaneous transm...
Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pel...
IFIP
2010
Springer
13 years 2 months ago
A Formal Analysis of Authentication in the TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers to achieve a greater level of security than is possible in software alone. To this end, the TPM pr...
Stéphanie Delaune, Steve Kremer, Mark Dermo...