Sciweavers

182 search results - page 21 / 37
» Infinite Possibilities
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Representation and Detection of Deformable Shapes
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
Pedro F. Felzenszwalb
CVPR
2009
IEEE
15 years 2 months ago
Let the Kernel Figure it Out; Principled Learning of Pre-processing for Kernel Classifiers
Most modern computer vision systems for high-level tasks, such as image classification, object recognition and segmentation, are based on learning algorithms that are able to se...
Peter V. Gehler, Sebastian Nowozin
APAL
2010
98views more  APAL 2010»
13 years 7 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
FMSB
2008
129views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
FORTE
2004
13 years 8 months ago
Symbolic Diagnosis of Partially Observable Concurrent Systems
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Thomas Chatain, Claude Jard