1712 search results - page 306 / 343 » A Computational Approach to Binding Theory |
105
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
135
click to vote
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
120
Voted
PODS
2007
ACM
16 years 1 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
103
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
119
click to vote
CIVR
2007
Springer
15 years 7 months ago
2007
Springer
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...