Sciweavers

9842 search results - page 1499 / 1969
» Compositional timing analysis
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 6 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CHI
2009
ACM
16 years 6 months ago
Information foraging in E-voting
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
Ravi K. Vatrapu, Scott P. Robertson
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 6 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
16 years 6 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
164
Voted
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
16 years 6 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
« Prev « First page 1499 / 1969 Last » Next »