Sciweavers

23630 search results - page 18 / 4726
» Common Information Model
Sort
View
CP
2011
Springer
12 years 7 months ago
CP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
Samba Ndojh Ndiaye, Christine Solnon
SARA
2009
Springer
14 years 1 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
14 years 1 months ago
Common Data Model for Design Document Exchange in Business-to-Business Networks
Design documents can be exchanged in business-tobusiness networks through Product Data Management (PDM) system integration. This rarely used approach provides new possibilities fo...
Katrine Jokinen, Jukka Borgman, Reijo Sulonen
TAMC
2007
Springer
14 years 1 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin