Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations
Tables:
DMCA
ITERATIVE GRAPH COMPUTATION IN THE BIG DATA ERA (2015)
Cached
Download Links
[ecommons.cornell.edu]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Wenlei Xie
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
4928
Computer Architecture: A Quantitative Approach
- Hennessy, Patterson - 2003
4650
The anatomy of a large-scale hypertextual web search engine
- Brin, Page - 1998
1370
A bridging model for parallel computation
- Valiant - 1990
768
Applied Numerical Linear Algebra
- Demmel - 1997
701
Level Set Methods and Fast Marching Methods. Evolving Interfaces
- Sethian - 1999
656
Domain Decomposition – Parallel Multilevel Methods for Elliptic Partial Differential Equations.
- Smith, Bjørstad, et al. - 1996
620
Der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
- Barrett, Berry, et al. - 1993
537
Topic-sensitive PageRank
- Haveliwala - 2002
518
Bounds on multiprocessing timing anomalies
- Graham - 1966
491
Pregel: a system for large-scale graph processing
- Malewicz, Austern, et al. - 2010
426
A new status index derived from sociometric analysis
- Katz - 1953
409
Scaling personalized web search
- Jeh, Widom - 2003
358
Simultaneous Statistical Inference
- Miller - 1981
316
Multilevel hypergraph partitioning: Application in VLSI domain
- Karypis, Aggarwal, et al. - 1999
299
A critique of ansi sql isolation levels
- Berenson, Bernstein, et al. - 1995
285
TwitterRank: finding topic-sensitive influential twitterers.
- Weng, Lim, et al. - 2010
262
Algorithm Design
- Kleinberg, Tardos - 2005
245
Collaborative Filtering with Temporal Dynamics
- Koren - 2009
214
Sparse Grids.
- Bungartz, Griebel - 2004
208
Deeper inside PageRank
- Langville, Meyer
200
Local graph partitioning using pagerank vectors
- Andersen, Chung, et al. - 2006
200
Arnetminer: extraction and mining of academic social networks
- Tang, Zhang, et al. - 2008
183
Near linear time algorithm to detect community structures in large-scale networks
- Raghavan, Albert, et al. - 2007
178
Optimistic parallelism requires abstractions
- Kulkarni, Pingali, et al. - 2007
171
Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter. In:
- Romero, Meeder, et al. - 2011
157
Oski: A library of automatically tuned sparse matrix kernels,”
- Vuduc, Demmel, et al. - 2005
147
Supervised random walks: Predicting and recommending links in social networks
- Backstrom, Leskovec - 2011
140
Distributed graphlab: A framework for machine learning in the cloud
- Low, Gonzalez, et al.
127
Powergraph: Distributed graph-parallel computation on natural graphs,”
- Gonzalez, Low, et al. - 2012
115
C.: Graphchi: large-scale graph computation on just a pc
- Kyrola, Blelloch, et al. - 2012
106
A survey on PageRank computing.
- Berkhin - 2005
106
A graph-theoretic perspective on centrality
- Borgatti, Everett
95
1994], Quasi-random sequences and their discrepancies
- Morokoff, Caflisch
93
Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1006.4990
- Low, Gonzalez, et al. - 2010
89
Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations, M2AN
- Grepl, Maday, et al.
85
Condition estimates
- Hager - 1984
85
TestU01: A C Library for Empirical Testing of Random Number Generators.
- L'ecuyer, Simard - 2007
84
Sparsity: Optimization framework for sparse matrix kernels
- Im, Yelick, et al. - 2004
80
Maintaining time-decaying stream aggregates,
- Cohen, Strauss - 2006
79
Nonlinear model reduction via discrete empirical interpolation
- Chaturantabut, Sorensen
65
Dynamic graph algorithms.
- Eppstein, Galil, et al. - 1999
60
Discrete-continuous optimization for largescale structure from motion
- Crandall, Owens, et al.
59
A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning.
- Spielman, Teng - 2008
53
A new look at proper orthogonal decomposition
- Rathinam, Petzold - 2003
53
Armadillo: An open source C++ linear algebra library for fast prototyping and computationally intensive experiments.
- Sanderson - 2010
52
Streaming graph partitioning for large distributed graphs.
- Stanton, Kliot - 2012
51
Learning to rank networked entities.
- Agarwal, Chakrabarti, et al. - 2006
51
Suggesting friends using the implicit social graph.
- Roth, Ben-David, et al. - 2010
50
Trinity: A Distributed Graph Engine on a Memory Cloud.
- SHAO, WANG, et al. - 2013
43
Optimizing graph algorithms for improved cache performance.
- Park, Penner, et al. - 2004
40
Pmrsb: parallel multilevel recursive spectral bisection.
- Barnard - 1995
40
Generalized distances between rankings,
- Kumar, Vassilvitskii - 2010
36
Fast incremental and personalized pagerank”,
- Bahmani, Chowdhury, et al. - 2010
36
Pegasus: A peta-scale graph mining system.
- Kang, T, et al. - 2009
33
Model Order Reduction: Theory, Research Aspects and Applications,
- Schilders, Vorst, et al. - 2008
31
Bookmark-coloring algorithm for personalized PageRank
- Berkhin
30
On biased reservoir sampling in the presence of stream evolution
- Aggarwal - 2006
30
Kineograph: taking the pulse of a fast-changing and connected world
- Cheng, Hong, et al. - 2012
30
Signal/collect: graph algorithms for the (semantic) web.
- Stutz, Bernstein, et al. - 2010
28
When cache blocking of sparse matrix vector multiply works and why.
- Nishtala, Vuduc, et al. - 2007
24
Differential dataflow
- McSherry, Murray, et al. - 2013
24
From “think like a vertex” to “think like a graph
- Tian, Balmin, et al.
23
Vagelis Hristidis, and Yannis Papakonstantinou. Objectrank: authority-based keyword search in databases
- Balmin - 2004
23
Graphx: Graph processing in a distributed dataflow framework.
- Gonzalez - 2014
22
TimeStream: Reliable stream computation in the cloud,
- Qian, He, et al. - 2013
21
Domain decomposition on parallel computers
- Gropp, Keyes - 1989
21
and Françoise Tisseur. A block algorithm for matrix 1-norm estimation, with an application to 1-norm pseudospectra
- Higham
20
On querying historical evolving graph sequences.
- Ren, Lo, et al. - 2011
17
Spinning Fast Iterative Data Flows
- EWEN, TZOUMAS, et al. - 2012
17
Inderpal Singh Mumick. Data Integration using SelfMaintainable Views
- Gupta, Jagadish - 1996
14
Hardware-Efficient Belief Propagation
- Liang, Cheng, et al. - 2009
13
Asynchronous large-scale graph processing made easy.
- Wang, Xie, et al. - 2013
12
Ranking spaces for predicting human movement in an urban environment.
- Jiang - 2009
12
Model reduction via proper orthogonal decomposition. In Model Order Reduction: Theory, Research Aspects and Applications,
- Pinnau - 2008
11
Knowing when you’re wrong: Building fast and reliable approximate query processing systems.
- Agarwal, Milner, et al. - 2014
11
Fast two-scale methods for eikonal equations
- Chacon, Vladimirsky
11
2013 A matrix iteration for dynamic network summaries
- Grindrod, DJ
10
Semi-supervised ranking on very large graphs with rich metadata.
- Gao, Liu, et al. - 2011
10
A refinement of the central limit theorem for sums of independent random indicators. Theory of Probability and its Applications,
- Volkova - 1996
9
Programming Kit. http://www.gnu.org/software/ glpk
- Linear
9
Ji-Rong Wen, and Wei-Ying Ma. Object-level ranking: bringing order to web objects
- Nie, Zhang - 2005
9
Modeling dynamic behavior in large evolving graphs.
- Rossi, Gallagher, et al. - 2013
8
Overlapping clusters for distributed computation
- Andersen, Gleich, et al. - 2012
8
Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
- Constantine, Gleich
7
Incorporating heterogeneous information for personalized tag recommendation in social tagging systems.
- Feng, Wang - 2012
4
Gianluca Iaccarino. Spectral methods for parameterized matrix equations
- Constantine, Gleich
4
Greedy and randomized versions of the multiplicative Schwarz method
- Griebel, Oswald - 2012
4
Duen Horng Chau, and Christos Faloutsos. Mining large graphs: Algorithms, inference, and discoveries
- Kang - 2011
3
Efficient Jump Ahead for 2-Linear Random Number Generators
- Haramoto, Matsumoto, et al.
3
Naresh Rapolu, Suresh Jagannathan, and Ananth Grama. Asynchronous algorithms in MapReduce
- Kambatla - 2010
3
Simulation Modeling and Analysis, McGraw-Hill, Fifth Edition.
- Law - 2015
3
An adaptive and efficient greedy procedure for the optimal training of parametric reduced-order models.
- Paul-Duboise-Taine, Amsallem - 2014
3
Vagelis Hristidis, and Louiqa Raschid. Explaining and reformulating authority flow queries
- Varadarajan - 2008
2
A Beattie, and Serkan Gugercin. Interpolatory model reduction of large-scale dynamical systems. In Efficient modeling and control of large-scale systems
- Antoulas, Christopher - 2010
2
Yannis Sismanis, Andrey Balmin, and Junghoo Cho. Scalable topic-specific influence analysis on microblogs
- Bi, Tian - 2014
2
Vagelis Hristidis, Louiqa Raschid, MariaEsther Vidal, Luis Daniel Ibáñez, and Héctor Rodrı́guez-Drumond. Flexible and efficient querying and ranking on hyperlinked data sources
- Varadarajan - 2009
2
Prioritized multiplicative Schwarz procedures for solving linear systems
- Wingate, Powell, et al. - 2005
1
Gianluca Iaccarino. A factorization of the spectral Galerkin system for parameterized matrix equations: Derivation and applications
- Constantine, Gleich
1
PageRank beyond the web. arXiv
- Gleich - 2014
1
Louiqa Raschid. Efficient ranking on entity graphs with personalized relationships
- Hristidis, Wu