Sciweavers

13603 search results - page 102 / 2721
» On the Complexity of Computing Treelength
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 4 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»
12 years 9 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»
13 years 8 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, ...
ICDCS
2011
IEEE
12 years 8 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...
GPC
2009
Springer
13 years 7 months ago
Dynamic Provision of Computing Resources from Grid Infrastructures and Cloud Providers
Grid computing involves the ability to harness together the power of computing resources. In this paper we push forward this philosophy and show technologies enabling federation o...
Constantino Vázquez Blanco, Eduardo Huedo, ...