Sciweavers

1076 search results - page 85 / 216
» Operations on proofs and labels
Sort
View
PRL
2007
100views more  PRL 2007»
13 years 8 months ago
Visible models for interactive pattern recognition
The bottleneck in interactive visual classification is the exchange of information between human and machine. We introduce the concept of the visible model, which is an ion of an ...
Jie Zou, George Nagy
PAMI
2011
13 years 3 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
PLDI
2009
ACM
14 years 9 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
FMCAD
2009
Springer
14 years 3 months ago
Assume-guarantee validation for STE properties within an SVA environment
Abstract—Symbolic Trajectory Evaluation is an industrialstrength verification method, based on symbolic simulation and abstraction, that has been highly successful in data path ...
Zurab Khasidashvili, Gavriel Gavrielov, Tom Melham
ENTCS
2000
114views more  ENTCS 2000»
13 years 8 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann