Sciweavers

2069 search results - page 122 / 414
» Linear time algorithms for Clobber
Sort
View
FOSSACS
2009
Springer
15 years 11 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
JCB
2007
97views more  JCB 2007»
15 years 4 months ago
Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications
Accurate prediction of pseudoknotted nucleic acid secondary structure is an important computational challenge. Prediction algorithms based on dynamic programming aim to find a st...
Baharak Rastegari, Anne Condon
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 1 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 9 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
PVLDB
2011
14 years 7 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet