5153 search results - page 571 / 1031 » Introduction to Randomized Algorithms |
163
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
159
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
174
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
149
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
159
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...