Sciweavers

1225 search results - page 85 / 245
» The Instance Complexity Conjecture
Sort
View
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
14 years 2 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
CAISE
2004
Springer
14 years 2 months ago
An Approach to Heterogeneous Data Translation based on XML Conversion
In this paper, we illustrate a preliminary approach to the translation of Web data between heterogeneous formats. This work fits into a larger project whose aim is the development...
Paolo Papotti, Riccardo Torlone
LICS
2003
IEEE
14 years 2 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
PPOPP
2003
ACM
14 years 2 months ago
A component architecture for LAM/MPI
To better manage the ever increasing complexity of LAM/MPI, we have created a lightweight component architecture for it that is specifically designed for high-performance message p...
Jeffrey M. Squyres
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...