Sciweavers

219 search results - page 3 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 5 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
13 years 9 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
TASLP
2008
108views more  TASLP 2008»
13 years 5 months ago
An Online Relevant Set Algorithm for Statistical Machine Translation
This paper presents a novel online relevant set algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the glob...
Christoph Tillmann, Tong Zhang
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
13 years 9 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 5 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky