725 search results - page 82 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
292
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
195
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
311
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
145
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
280
click to vote
ICLP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...