Sciweavers

4930 search results - page 188 / 986
» Learning minimal abstractions
Sort
View
CORR
2006
Springer
124views Education» more  CORR 2006»
15 years 6 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...
INFORMS
2010
110views more  INFORMS 2010»
15 years 3 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
CVPR
2009
IEEE
17 years 1 months ago
Learning from Ambiguously Labeled Images
In many image and video collections, we have access only to partially labeled data. For example, personal photo collections often contain several faces per image and a caption t...
Benjamin Sapp, Benjamin Taskar, Chris Jordan, Timo...
ICCV
2003
IEEE
16 years 8 months ago
Automatically Labeling Video Data Using Multi-class Active Learning
Labeling video data is an essential prerequisite for many vision applications that depend on training data, such as visual information retrieval, object recognition, and human act...
Rong Yan, Jie Yang, Alexander G. Hauptmann
ICML
2007
IEEE
16 years 7 months ago
More efficiency in multiple kernel learning
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
Alain Rakotomamonjy, Francis Bach, Stéphane...