Sciweavers

1746 search results - page 39 / 350
» Recent Developments in Algorithmic Teaching
Sort
View
SIGACT
2010
74views more  SIGACT 2010»
13 years 7 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
BMCBI
2006
139views more  BMCBI 2006»
13 years 9 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
NETWORKS
2008
13 years 9 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
CCE
2004
13 years 9 months ago
Part II. Future perspective on optimization
Following from part I, which presents a retrospective on optimization, we focus here on areas that are recent active research topics and are likely to strongly influence the futur...
Ignacio E. Grossmann, Lorenz T. Biegler
EVOW
2010
Springer
14 years 13 days ago
Towards Automated Learning of Object Detectors
Recognizing arbitrary objects in images or video sequences is a difficult task for a computer vision system. We work towards automated learning of object detectors from video seque...
Marc Ebner