Sciweavers

10146 search results - page 323 / 2030
» Fast FAST
Sort
View
RECOMB
2001
Springer
16 years 5 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 5 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 5 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
97views Algorithms» more  STOC 2005»
16 years 5 months ago
Fast quantum byzantine agreement
Michael Ben-Or, Avinatan Hassidim
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 5 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren