Sciweavers

86 search results - page 13 / 18
» Entailment of Finite Domain Constraints
Sort
View
SCN
2008
Springer
126views Communications» more  SCN 2008»
13 years 7 months ago
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
We consider the task of computing power productsQ 1ik gei i ("multi-exponentiation") where base elements g2, . . ., gk are fixed while g1 is variable between multi-expone...
Bodo Möller, Andy Rupp
SAC
2004
ACM
14 years 1 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
ICTAI
2009
IEEE
13 years 5 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
EACL
1993
ACL Anthology
13 years 9 months ago
A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
Geoffrey Simmons
FLOPS
2008
Springer
13 years 9 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...