Sciweavers

1554 search results - page 113 / 311
» cases 2003
Sort
View
156
Voted
FOCS
2003
IEEE
15 years 10 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
151
Voted
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
15 years 7 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang
134
Voted
AOIS
2003
15 years 6 months ago
Trustworthy Service Caching: Cooperative Search in P2P Information Systems
We are developing an approach for P2P information systems, where the peers are modeled as autonomous agents. Agents provide services or give referrals to one another to help find...
Yathiraj B. Udupi, Pinar Yolum, Munindar P. Singh
148
Voted
AOIS
2003
15 years 6 months ago
Towards a More Expressive and Refinable Multiagent System Engineering Methodology
In this paper, we improve and extend the MaSE methodology to bridge the gaps in this methodology. First, we propose an improvement process and, based on this process, we report th...
Shiva Vafadar, Ahmad Abdollahzadeh Barfouroush, Mo...
DMCS
2003
15 years 6 months ago
A Reciprocity Theorem for Monomer-Dimer Coverings
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
Nick Anzalone, John Baldwin, Ilya Bronshtein, T. K...