Sciweavers

1686 search results - page 28 / 338
» Programs as polygraphs: computability and complexity
Sort
View
JMLR
2012
13 years 3 days ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
PVM
2010
Springer
14 years 7 months ago
Efficient MPI Support for Advanced Hybrid Programming Models
The number of multithreaded Message Passing Interface (MPI) implementations and applications is increasing rapidly. We discuss how multithreaded applications can receive messages o...
Torsten Hoefler, Greg Bronevetsky, Brian Barrett, ...
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 2 days ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...
77
Voted
SC
2004
ACM
15 years 3 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
COMPSAC
2005
IEEE
15 years 3 months ago
Using AOP to Monitor and Administer Software for Grid Computing Environments
Monitoring is a task of collecting measurements that reflect the state of a system. Administration is a collection of tasks for control and manipulation of computer systems. Monito...
Mark Grechanik, Dewayne E. Perry, Don S. Batory