200 search results - page 29 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
193
click to vote
CL
2012
Springer
13 years 5 days ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
164
click to vote
PVLDB
2010
14 years 4 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
AAAI
2008
15 years 2 days ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
BMCBI
2006
14 years 9 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...