952 search results - page 31 / 191 » Computational complexity of stochastic programming problems |
AUIC
2000
IEEE
14 years 3 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
BMCBI
2004
13 years 10 months ago
2004
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
FGCS
2008
13 years 11 months ago
2008
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
ICALP
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
COLING
2000
14 years 9 days ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...