Sciweavers

6365 search results - page 23 / 1273
» Fast Local Computation Algorithms
Sort
View
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 9 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 2 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
SIGPRO
2008
89views more  SIGPRO 2008»
15 years 2 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
COCOON
2009
Springer
15 years 9 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
ALMOB
2008
131views more  ALMOB 2008»
15 years 2 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas