Sciweavers

241 search results - page 28 / 49
» Implicit Parallelism
Sort
View
ISHPC
1997
Springer
14 years 2 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher
APPINF
2003
13 years 11 months ago
A Multithreaded Compiler Backend for High-level Array Programming
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level array prog...
Clemens Grelck
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
12 years 8 days ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
COLCOM
2008
IEEE
14 years 4 months ago
GroupBanter: Supporting Serendipitous Group Conversations with IM
This paper describes GroupBanter, a tool for supporting serendipitous group conversations using instant messaging. We investigate the potential of ephemeral group conversations by ...
Kori Inkpen, Steve Whittaker, Mary Czerwinski, Rol...
APSCC
2007
IEEE
14 years 4 months ago
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement pro...
Raylin Tso, Xun Yi, Eiji Okamoto