Sciweavers

12774 search results - page 143 / 2555
» A Framework for Proof Systems
Sort
View
JFPLC
2004
15 years 5 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
15 years 2 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
WOLLIC
2009
Springer
15 years 11 months ago
Ludics and Its Applications to Natural Language Semantics
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
Alain Lecomte, Myriam Quatrini
CSFW
2009
IEEE
15 years 11 months ago
Achieving Security Despite Compromise Using Zero-knowledge
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
Michael Backes, Martin P. Grochulla, Catalin Hritc...
LICS
2009
IEEE
15 years 11 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson