Sciweavers

252 search results - page 25 / 51
» Optimal Sequential Exploration: A Binary Learning Model
Sort
View
EWRL
2008
13 years 9 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 2 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
ECCV
2010
Springer
13 years 10 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
ICML
2004
IEEE
14 years 8 months ago
Learning large margin classifiers locally and globally
A new large margin classifier, named MaxiMin Margin Machine (M4 ) is proposed in this paper. This new classifier is constructed based on both a "local" and a "globa...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
ICML
2004
IEEE
14 years 8 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...