Sciweavers

1712 search results - page 191 / 343
» A Computational Approach to Binding Theory
Sort
View
140
Voted
AGP
2010
IEEE
15 years 7 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
BIRTHDAY
2008
Springer
15 years 3 months ago
Transformations in Reconfigurable Place/Transition Systems
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...
Ulrike Prange, Hartmut Ehrig, Kathrin Hoffmann, Ju...
ACL
2010
14 years 12 months ago
Learning to Translate with Source and Target Syntax
Statistical translation models that try to capture the recursive structure of language have been widely adopted over the last few years. These models make use of varying amounts o...
David Chiang
133
Voted
CVPR
2005
IEEE
16 years 3 months ago
Coupled PDEs for Non-Rigid Registration and Segmentation
In this paper we present coupled partial differential equations (PDEs) for the problem of joint segmentation and registration. The registration component of the method estimates a...
Gozde B. Unal, Gregory G. Slabaugh
CVPR
2006
IEEE
16 years 3 months ago
Efficient Optimal Kernel Placement for Reliable Visual Tracking
This paper describes a novel approach to optimal kernel placement in kernel-based tracking. If kernels are placed at arbitrary places, kernel-based methods are likely to be trappe...
Zhimin Fan, Ming Yang, Ying Wu, Gang Hua, Ting Yu