The following pages link to UbiCrawler (Q25113):
Displaying 32 items.
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds (Q439985) (← links)
- Practical acceleration for computing the HITS expertrank vectors (Q442725) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Off-diagonal low-rank preconditioner for difficult PageRank problems (Q1624665) (← links)
- Graph compression by BFS (Q1662490) (← links)
- An efficient elimination strategy for solving PageRank problems (Q1735084) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Steady-state analysis of google-like stochastic matrices with block iterative methods (Q2447346) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors (Q2668354) (← links)
- Fast compressed tries through path decompositions (Q2828185) (← links)
- Complex network partitioning using label propagation (Q2830633) (← links)
- On the bit-complexity of Lempel-Ziv compression (Q2862201) (← links)
- Counting Triangles in Massive Graphs with MapReduce (Q2940042) (← links)
- Computing Strongly Connected Components in the Streaming Model (Q2999346) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Traps and Pitfalls of Topic-Biased PageRank (Q3520034) (← links)
- Performance Modeling of a Distributed Web Crawler Using Stochastic Activity Networks (Q3628508) (← links)
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization (Q4588862) (← links)
- Fast Construction of Compressed Web Graphs (Q5150926) (← links)
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Q5150934) (← links)
- (Q5294080) (← links)
- (Q5298941) (← links)
- Algorithms and Models for the Web-Graph (Q5311168) (← links)
- Speeding Up Algorithms on Compressed Web Graphs (Q5388292) (← links)
- Theory and practice of monotone minimal perfect hashing (Q5406248) (← links)
- Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model (Q5458302) (← links)
- LiveRank: How to Refresh Old Datasets (Q5856431) (← links)
