Sciweavers

253 search results - page 5 / 51
» Data structures in Java for matrix computations
Sort
View
170
Voted
SDM
2009
SIAM
202views Data Mining» more  SDM 2009»
16 years 26 days ago
Proximity-Based Anomaly Detection Using Sparse Structure Learning.
We consider the task of performing anomaly detection in highly noisy multivariate data. In many applications involving real-valued time-series data, such as physical sensor data a...
Tsuyoshi Idé, Aurelie C. Lozano, Naoki Abe,...
127
Voted
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
15 years 10 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
156
Voted
EUROPAR
2000
Springer
15 years 7 months ago
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
David S. Wise
124
Voted
CF
2005
ACM
15 years 5 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
148
Voted
PLDI
2010
ACM
15 years 8 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...