Sciweavers

5329 search results - page 936 / 1066
» The Weighted Majority Algorithm
Sort
View
141
Voted
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 4 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
151
Voted
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
141
Voted
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 4 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
132
Voted
DCC
2007
IEEE
16 years 3 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...
153
Voted
SOSP
2009
ACM
16 years 19 days ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...