Sciweavers

4137 search results - page 793 / 828
» On the number of matchings of a tree
Sort
View
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
FOSSACS
2005
Springer
14 years 1 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
GD
2005
Springer
14 years 1 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
OTM
2005
Springer
14 years 1 months ago
GeRoMe: A Generic Role Based Metamodel for Model Management
Abstract. The goal of Model Management is the development of new technologies and mechanisms to support the integration, evolution and matching of models. Such tasks are to be perf...
David Kensche, Christoph Quix, Mohamed Amine Chatt...
SEMWEB
2005
Springer
14 years 1 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen