Sciweavers

749 search results - page 149 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Combining model-based and instance-based learning for first order regression
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...
Kurt Driessens, Saso Dzeroski
ICCV
1995
IEEE
14 years 2 days ago
Closed-World Tracking
A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the co...
Stephen S. Intille, Aaron F. Bobick
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 2 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 8 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...