Sciweavers

2914 search results - page 111 / 583
» Learning and Inference with Constraints
Sort
View
POPL
2007
ACM
14 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
COLT
2004
Springer
14 years 3 months ago
Replacing Limit Learners with Equally Powerful One-Shot Query Learners
Different formal learning models address different aspects of human learning. Below we compare Gold-style learning—interpreting learning as a limiting process in which the lear...
Steffen Lange, Sandra Zilles
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
14 years 2 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
BPM
2006
Springer
115views Business» more  BPM 2006»
14 years 1 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
CVPR
2009
IEEE
15 years 5 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...