Sciweavers

3341 search results - page 633 / 669
» On Bounded Queries and Approximation
Sort
View
RECOMB
2008
Springer
15 years 10 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
15 years 10 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
ICFP
2008
ACM
15 years 9 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
MOBIHOC
2008
ACM
15 years 9 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan