Sciweavers

923 search results - page 136 / 185
» The Computational Structure of Progress Conditions
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ENVSOFT
2006
117views more  ENVSOFT 2006»
14 years 9 months ago
Land information system: An interoperable framework for high resolution land surface modeling
Knowledge of land surface water, energy, and carbon conditions are of critical importance due to their impact on many real world applications such as agricultural production, wate...
Sujay V. Kumar, Christa D. Peters-Lidard, Yudong T...
AI
2000
Springer
14 years 9 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
JMLR
2010
165views more  JMLR 2010»
14 years 4 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
CVPR
2012
IEEE
13 years 4 days ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...