Sciweavers

1717 search results - page 203 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
WWW
2003
ACM
15 years 10 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
15 years 10 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
RECOMB
2003
Springer
15 years 10 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
INFOCOM
2008
IEEE
15 years 4 months ago
Utility Max-Min Fair Congestion Control with Time-Varying Delays
Abstract—We present a framework for designing delayindependent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only requir...
Konstantin Miller, Tobias Harks