Sciweavers

1497 search results - page 94 / 300
» A Computational Model for Message Passing
Sort
View
IJCAI
2003
15 years 2 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
CCS
2010
ACM
15 years 1 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
15 years 8 months ago
Collusion-Free Multiparty Computation in the Mediated Model
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...
TMC
2008
127views more  TMC 2008»
15 years 1 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
AAAI
1997
15 years 2 months ago
Models of Continual Computation
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
Eric Horvitz