Sciweavers

13603 search results - page 204 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
TROB
2002
120views more  TROB 2002»
15 years 6 months ago
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
N. R. Srinivasa Raghavan, Tanmay Waghmare
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 1 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
IACR
2011
94views more  IACR 2011»
14 years 6 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, ...
ESORICS
2006
Springer
15 years 10 months ago
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
Milan Fort, Felix C. Freiling, Lucia Draque Penso,...