Sciweavers

186 search results - page 34 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Parallelization of DQMC simulation for strongly correlated electron systems
Abstract--Determinant Quantum Monte Carlo (DQMC) simulation has been widely used to reveal macroscopic properties of strong correlated materials. However, parallelization of the DQ...
Che-Rung Lee, I-Hsin Chung, Zhaojun Bai
WWW
2007
ACM
14 years 8 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
EPEW
2005
Springer
14 years 1 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
ICWSM
2009
13 years 5 months ago
Gephi: An Open Source Software for Exploring and Manipulating Networks
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and ...
Mathieu Bastian, Sebastien Heymann, Mathieu Jacomy
SCALESPACE
2007
Springer
14 years 1 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré