Sciweavers

884 search results - page 20 / 177
» Control structures in programs and computational complexity
Sort
View
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
VMCAI
2007
Springer
14 years 1 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif
SAGA
2009
Springer
14 years 2 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
JMLR
2012
11 years 10 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
IPPS
2008
IEEE
14 years 2 months ago
Wait-free Programming for General Purpose Computations on Graphics Processors
The fact that graphics processors (GPUs) are today’s most powerful computational hardware for the dollar has motivated researchers to utilize the ubiquitous and powerful GPUs fo...
Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus