4007 search results - page 355 / 802 » Computation with imprecise probabilities |
200
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
182
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
We develop techniques to estimate the statistical significance of gap-free alignments between two genomic DNA sequences, using human-mouse alignments as an example. The sequences ...
209
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
194
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
203
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...