Sciweavers

128 search results - page 25 / 26
» Rewriting Constraint Models with Metamodels
Sort
View
CVPR
2009
IEEE
15 years 27 days ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 6 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
FROCOS
2007
Springer
13 years 12 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
COOPIS
2003
IEEE
13 years 11 months ago
Ontology Based Query Processing in Database Management Systems
The use of semantic knowledge in its various forms has become an important aspect in managing data in database and information systems. In the form of integrity constraints, it ha...
Chokri Ben Necib, Johann Christoph Freytag
MMMACNS
2001
Springer
13 years 10 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato