401 search results - page 16 / 81 » Sparse Quasi-Random Graphs |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
HIPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...