Sciweavers

6251 search results - page 423 / 1251
» Randomness, Computability, and Density
Sort
View
IPPS
2006
IEEE
16 years 26 days ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
EUROCRYPT
2007
Springer
15 years 10 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
TMI
2008
92views more  TMI 2008»
15 years 6 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
EDBT
2010
ACM
246views Database» more  EDBT 2010»
16 years 1 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
ATAL
2009
Springer
16 years 1 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...