1402 search results - page 199 / 281 » Sparse-Memory Graph Search |
132
Voted
PLDI
1995
ACM
15 years 6 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
141
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
112
click to vote
3DOR
2009
15 years 3 months ago
2009
Most of the approaches which address the problem of 3D object retrieval, use global descriptors of the objects which fail to consistently compensate for the intra-class variabilit...
106
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
119
Voted
EC
2007
15 years 2 months ago
2007
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...