189 search results - page 23 / 38 » SCARAB: scaling reachability computation on large graphs |
116
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
120
click to vote
TSE
2011
14 years 4 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
KDD
2010
ACM
14 years 8 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
SLIP
2009
ACM
15 years 4 months ago
2009
ACM
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
SC
2005
ACM
15 years 3 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...