Sciweavers

1137 search results - page 194 / 228
» Partial Program Admission
Sort
View
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 8 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
SOCA
2008
IEEE
13 years 8 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
IVC
2007
107views more  IVC 2007»
13 years 8 months ago
A review of recent range image registration methods with accuracy evaluation
The three-dimensional reconstruction of real objects is an important topic in computer vision. Most of the acquisition systems are limited to reconstruct a partial view of the obj...
Joaquim Salvi, Carles Matabosch, David Fofi, Josep...
BMCBI
2005
99views more  BMCBI 2005»
13 years 8 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich