Sciweavers

3082 search results - page 577 / 617
» Deviation Analysis: A New Use of Model Checking
Sort
View
AI
2000
Springer
14 years 11 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
195views more  JMLR 2010»
14 years 10 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
SPIRE
2010
Springer
14 years 10 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
PKDD
2010
Springer
153views Data Mining» more  PKDD 2010»
14 years 9 months ago
A Robustness Measure of Association Rules
Abstract. We propose a formal definition of the robustness of association rules for interestingness measures. It is a central concept in the evaluation of the rules and has only be...
Yannick Le Bras, Patrick Meyer, Philippe Lenca, St...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 9 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...