Sciweavers

867 search results - page 123 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
13 years 11 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 8 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
WWW
2007
ACM
14 years 8 months ago
The discoverability of the web
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christ...
ECCV
2008
Springer
14 years 6 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee