Sciweavers

349 search results - page 60 / 70
» The Finite and the Infinite
Sort
View
ACL
2010
13 years 8 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
CVPR
2009
IEEE
15 years 5 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
TPHOL
1999
IEEE
14 years 2 months ago
Disjoint Sums over Type Classes in HOL
The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinit...
Norbert Völker
ICARCV
2008
IEEE
151views Robotics» more  ICARCV 2008»
14 years 4 months ago
Model-Based Networked Control System stability based on packet drop distributions
Abstract—This paper studies the system stability of a ModelBased Networked Control System in the cases where packet losses follow a certain distributions. In this study, the unre...
Lanzhi Teng, Peng Wen, Wei Xiang
ESCIENCE
2006
IEEE
14 years 1 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans