ICA

2012

Springer

12 years 4 months ago
2012

Springer

A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...

CORR

2012

Springer

12 years 4 months ago
2012

Springer

Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...

PAKDD

2011

ACM

12 years 12 months ago
2011

ACM

Abstract. Given a graph with billions of nodes and edges, how can we ﬁnd patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...

CORR

2011

Springer

13 years 4 months ago
2011

Springer

Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...

PC

2002

13 years 8 months ago
2002

We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...

COMPUTING

2006

13 years 9 months ago
2006

With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203

AC

2008

Springer

13 years 9 months ago
2008

Springer

Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...

DATESO

2004

13 years 10 months ago
2004

Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...

CATA

2010

13 years 10 months ago
2010

Computations with sparse matrices on "multicore cache based" computers are affected by the irregularity of the problem at hand, and performance degrades easily. In this ...

CF

2005

ACM

13 years 11 months ago
2005

ACM

In this paper, we consider alternate ways of storing a sparse matrix and their eﬀect on computational speed. They involve keeping both the indices and the non-zero elements in t...