Sciweavers

850 search results - page 157 / 170
» The structure of information pathways in a social communicat...
Sort
View
IJFCS
2006
106views more  IJFCS 2006»
13 years 8 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
CIKM
2007
Springer
14 years 2 months ago
Optimal proactive caching in peer-to-peer network: analysis and application
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Ying...
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
SP
2006
IEEE
100views Security Privacy» more  SP 2006»
14 years 1 months ago
Fundamental Limits on the Anonymity Provided by the MIX Technique
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Di...