Sciweavers

1431 search results - page 35 / 287
» The complexity of random ordered structures
Sort
View
AIPS
2007
15 years 9 hour ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
FOSSACS
2007
Springer
15 years 3 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
JMLR
2010
135views more  JMLR 2010»
14 years 4 months ago
Structured Prediction Cascades
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
David Weiss, Benjamin Taskar
ICCV
2005
IEEE
15 years 3 months ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong
VLDB
2005
ACM
140views Database» more  VLDB 2005»
15 years 3 months ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...