4940 search results - page 440 / 988 » On the Complexity of Universal Programs |
190
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
184
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
206
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
185
click to vote
TCC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
222
click to vote
WAW
2004
Springer
16 years 6 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...