91 search results - page 6 / 19 » Using PageRank to Locally Partition a Graph |
IJCAI
2007
14 years 11 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
IAT
2009
IEEE
15 years 1 months ago
2009
IEEE
We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...
114
click to vote
JMLR
2012
12 years 12 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...