Sciweavers

1517 search results - page 100 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
SAINT
2007
IEEE
15 years 11 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka
IDA
2002
Springer
15 years 4 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
USENIX
1994
15 years 6 months ago
Large Granularity Cache Coherence for Intermittent Connectivity
To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of ca...
Lily B. Mummert, Mahadev Satyanarayanan
POPL
2012
ACM
14 years 17 days ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
16 years 2 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...