4047 search results - page 338 / 810 » The Discrete Basis Problem |
179
click to vote
COR
2011
15 years 1 days ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
165
click to vote
JBCB
2010
14 years 12 months ago
2010
Protein function prediction is an active area of research in bioinformatics. And yet, transfer of annotation on the basis of sequence or structural similarity remains widely used ...
115
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
302
click to vote
PROPOR
2012
Springer
14 years 18 days ago
2012
Springer
Fill-in-the-blank questions are one of the main assessment devices in REAP.PT tutoring system. The problem of automatically generating the stems, i.e. the sentences that serve as b...
155
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in ...