Sciweavers

1059 search results - page 106 / 212
» Discovering Sequence Similarity by the Algorithmic Significa...
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
CAV
2007
Springer
121views Hardware» more  CAV 2007»
14 years 3 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
APPT
2007
Springer
13 years 10 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
IJCAI
1989
13 years 10 months ago
Noise-Tolerant Instance-Based Learning Algorithms
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
David W. Aha, Dennis F. Kibler
IJISTA
2008
87views more  IJISTA 2008»
13 years 8 months ago
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
Olaf Kähler, Erik Rodner, Joachim Denzler