Sciweavers

10608 search results - page 350 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
93
Voted
ICALP
2005
Springer
15 years 6 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
88
Voted
ICANN
2005
Springer
15 years 6 months ago
Batch-Sequential Algorithm for Neural Networks Trained with Entropic Criteria
The use of entropy as a cost function in the neural network learning phase usually implies that, in the back-propagation algorithm, the training is done in batch mode. Apart from t...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
103
Voted
KELSI
2004
Springer
15 years 6 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
90
Voted
PATMOS
2004
Springer
15 years 6 months ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
102
Voted
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 5 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye