Sciweavers

ICDE
2012
IEEE
216views Database» more  ICDE 2012»
11 years 7 months ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
12 years 8 months ago
Power management of online data-intensive services
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
David Meisner, Christopher M. Sadler, Luiz Andr&ea...
JMIV
2011
179views more  JMIV 2011»
12 years 11 months ago
3-D Data Denoising and Inpainting with the Low-Redundancy Fast Curvelet Transform
In this paper, we first present a new implementation of the 3-D fast curvelet transform, which is nearly 2.5 less redundant than the Curvelab (wrapping-based) implementation as o...
A. Woiselle, Jean-Luc Starck, Jalal Fadili
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 1 months ago
Computation in Large-Scale Scientific and Internet Data Applications is a Focus of MMDS 2010
A report is provided for the ACM SIGKDD community about the 2010 Workshop on Algorithms for Modern Massive Data Sets (MMDS 2010), its origin in MMDS 2006 and MMDS 2008, and future...
Michael W. Mahoney
TC
2008
13 years 4 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 4 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
IVS
2008
138views more  IVS 2008»
13 years 4 months ago
Extending the attribute explorer to support professional team-sport analysis
Advances in interactive systems and the ability to manage increasing amounts of high-dimensional data provide new opportunities in numerous domains. Information visualization tech...
Pär-Anders Albinsson, Dennis Andersson
ICML
2010
IEEE
13 years 5 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
EDBTW
2006
Springer
13 years 8 months ago
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
Dimitris Sacharidis
SPIRE
2009
Springer
13 years 11 months ago
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
Yoram Bachrach, Ralf Herbrich, Ely Porat