Sciweavers

386 search results - page 24 / 78
» Fundamental Questions
Sort
View
HYBRID
2007
Springer
14 years 4 months ago
Composing Semi-algebraic O-Minimal Automata
This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is the case in many exemplar systems, b...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...
EWCBR
2004
Springer
14 years 3 months ago
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
Steven Bogaerts, David B. Leake
ETRICS
2006
14 years 1 months ago
Privacy-Preserving Decision Tree Mining Based on Random Substitutions
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
Jim Dowd, Shouhuai Xu, Weining Zhang
EXACT
2008
14 years 5 days ago
Deriving Explanations From Partial Temporal Information
The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human think...
Jixin Ma, Brian Knight, Miltos Petridis
CLIN
2004
13 years 11 months ago
Extended Lexical Units in Dutch
The paper describes ongoing empirical research into a fundamental problem of linguistics, viz. the architecture of grammar, or the division of labor between lexicon and grammar. W...
Michaela Poß, Ton van der Wouden