112 search results - page 21 / 23 » Neighborhood based fast graph search in large networks |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
108
click to vote
KDD
2012
ACM
13 years 19 hour ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
101
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
106
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
106
click to vote
ICDE
2012
IEEE
13 years 1 days ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...