290 search results - page 33 / 58 » Local Partitioning for Directed Graphs Using PageRank |
148
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
116
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
122
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Occlusion is one of the major consequences of the physical image generation process: it occurs when an opaque object partly obscures the view of another object further away from t...
130
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...