Sciweavers

2370 search results - page 271 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
MST
1998
91views more  MST 1998»
15 years 3 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 4 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
16 years 4 months ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White
94
Voted
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 4 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
116
Voted
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 10 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...