Sciweavers

38 search results - page 7 / 8
» Learning Languages from Positive Data and a Finite Number of...
Sort
View
AAAI
2006
13 years 8 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
COLT
2006
Springer
13 years 11 months ago
Memory-Limited U-Shaped Learning
U-shaped learning is a learning behaviour in which the learner first learns a given target behaviour, then unlearns it and finally relearns it. Such a behaviour, observed by psych...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...
CIKM
2008
Springer
13 years 9 months ago
Active relevance feedback for difficult queries
Relevance feedback has been demonstrated to be an effective strategy for improving retrieval accuracy. The existing relevance feedback algorithms based on language models and vect...
Zuobing Xu, Ram Akella
ICPR
2006
IEEE
14 years 8 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
PODS
1999
ACM
151views Database» more  PODS 1999»
13 years 11 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin