72 search results - page 11 / 15 » Practical approximation algorithms for zero- and bounded-ske... |
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
AI
2002
Springer
14 years 9 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
NIPS
2007
14 years 11 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
172
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...