40 search results - page 8 / 8 » Sparse matrix storage revisited |
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
WSDM
2012
ACM
12 years 5 months ago
2012
ACM
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
KDD
2012
ACM
12 years 6 days ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
HPDC
2006
IEEE
14 years 3 months ago
2006
IEEE
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...