CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
When an agent resides in a community, the opinion of other community members concerning whether a particular individual is trustworthy or not influences the trust level of this ag...
CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...
CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
COMPLEX
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We investigate a spin model in which a ferromagnetic shortrange interaction competes with a long-range antiferromagnetic interaction decaying spatially as 1 rd+ , d being...
ACMSE
2009
ACM
13 years 9 months ago
2009
ACM
It is getting harder to extract useful information from the enormous amount of data that is being collected in the medical information systems or eHealth systems due to the distri...
ACMSE
2009
ACM
13 years 9 months ago
2009
ACM
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
WG
2010
Springer
13 years 9 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
WG
2010
Springer
13 years 9 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...