Sciweavers

1539 search results - page 2 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
GD
2000
Springer
13 years 9 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
DOCENG
2006
ACM
13 years 11 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
BMCBI
2008
121views more  BMCBI 2008»
13 years 5 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...

Tutorial
5774views
15 years 6 months ago
On the implementation of fast marching methods for 3D lattices
This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discre...
Jakob Andreas Bærentzen