Sciweavers

267 search results - page 12 / 54
» Signatures of Combinatorial Maps
Sort
View
SAT
2004
Springer
99views Hardware» more  SAT 2004»
14 years 2 months ago
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
Carlos Ansótegui, Felip Manyà
ATAL
2007
Springer
14 years 3 months ago
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
ICAPR
2005
Springer
14 years 2 months ago
The RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
Marco Gori, Marco Maggini, Lorenzo Sarti
ESWS
2006
Springer
14 years 22 days ago
RDFBroker: A Signature-Based High-Performance RDF Store
Abstract. Many approaches for RDF stores exist, most of them using very straight-forward techniques to store triples in or mapping RDF Schema classes to database tables. In this pa...
Michael Sintek, Malte Kiesel
ASIACRYPT
2006
Springer
14 years 24 days ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth