Sciweavers

403 search results - page 41 / 81
» Data Partitioning for Minimizing Transferred Data in MapRedu...
Sort
View
SISW
2005
IEEE
15 years 9 months ago
File System Design with Assured Delete
This paper describes a system that supports high availability of data, until the data should be expunged, at which time it is impossible to recover the data. This design supports ...
Radia J. Perlman
VISUALIZATION
2005
IEEE
15 years 9 months ago
Distributed Data Management for Large Volume Visualization
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users wit...
Jinzhu Gao, Jian Huang, C. Ryan Johnson, Scott Atc...
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
14 years 7 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
BMCBI
2008
166views more  BMCBI 2008»
15 years 4 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
169
Voted
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
14 years 7 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski