Sciweavers

113 search results - page 15 / 23
» A Fast Multi-scale Method for Drawing Large Graphs
Sort
View
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
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...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
ICML
2010
IEEE
13 years 8 months ago
Power Iteration Clustering
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
Frank Lin, William W. Cohen
SPIRE
2009
Springer
14 years 2 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
ECCV
2008
Springer
13 years 9 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
BMCBI
2010
148views more  BMCBI 2010»
13 years 7 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...