Sciweavers

1096 search results - page 89 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
BMCBI
2005
87views more  BMCBI 2005»
15 years 6 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
ICML
1995
IEEE
16 years 7 months ago
Residual Algorithms: Reinforcement Learning with Function Approximation
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
Leemon C. Baird III
CVPR
2007
IEEE
16 years 8 months ago
Nonnegative Tucker Decomposition
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
Yong-Deok Kim, Seungjin Choi
PPDP
2005
Springer
15 years 11 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
PLDI
1998
ACM
15 years 10 months ago
Simplification of Array Access Patterns for Compiler Optimizations
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Yunheung Paek, Jay Hoeflinger, David A. Padua