1830 search results - page 207 / 366 » Workshop on Graph Computation Models |
180
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
147
click to vote
IPPS
2006
IEEE
16 years 4 days ago
2006
IEEE
This paper presents a Java framework based on separation of concerns and code generation concepts that facilitates development of concurrency and I/O in servers. In this approach,...
151
click to vote
KIVS
2005
Springer
15 years 11 months ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
149
click to vote
DAC
1993
ACM
15 years 10 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
149
Voted
SC
1990
ACM
15 years 10 months ago
1990
ACM
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...