Sciweavers

5096 search results - page 827 / 1020
» Associations as a Language Construct
Sort
View
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 10 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
LICS
1997
IEEE
15 years 10 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
ICTL
1994
15 years 10 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
ECAI
1992
Springer
15 years 10 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
DAS
2010
Springer
15 years 10 months ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar