Sciweavers

16093 search results - page 3050 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
SIAMSC
2010
165views more  SIAMSC 2010»
15 years 5 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TCS
2010
15 years 4 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
TIP
2010
129views more  TIP 2010»
15 years 4 months ago
Selective Data Pruning-Based Compression Using High-Order Edge-Directed Interpolation
—This paper proposes a selective data pruning-based compression scheme to improve the rate-distortion relation of compressed images and video sequences. The original frames are p...
Dung Trung Vo, Joel Solé, Peng Yin, Cristin...
« Prev « First page 3050 / 3219 Last » Next »