Sciweavers

6365 search results - page 26 / 1273
» Fast Local Computation Algorithms
Sort
View
CPM
2008
Springer
129views Combinatorics» more  CPM 2008»
14 years 11 months ago
Fast Algorithms for Computing Tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
STRINGOLOGY
2008
14 years 11 months ago
Fast Optimal Algorithms for Computing All the Repeats in a String
Simon J. Puglisi, William F. Smyth, Munina Yusufu
BIOCOMP
2009
14 years 11 months ago
Fast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings
Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, ...
57
Voted
CN
2008
93views more  CN 2008»
14 years 10 months ago
A fast algorithm for computing minimum routing cost spanning trees
Rui Campos, Manuel Ricardo
67
Voted
AUTOMATICA
2000
57views more  AUTOMATICA 2000»
14 years 9 months ago
A fast algorithm for the computation of an upper bound on the µ-norm
Craig T. Lawrence, André L. Tits, Paul Van ...