Sciweavers

5448 search results - page 631 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 9 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
IPPS
1996
IEEE
15 years 11 months ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 5 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
ICS
2009
Tsinghua U.
15 years 4 months ago
R-ADMAD: high reliability provision for large-scale de-duplication archival storage systems
Data de-duplication has become a commodity component in dataintensive systems and it is required that these systems provide high reliability comparable to others. Unfortunately, b...
Chuanyi Liu, Yu Gu, Linchun Sun, Bin Yan, Dongshen...
IPPS
1999
IEEE
15 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...