Sciweavers

59 search results - page 5 / 12
» An Algorithm for Incremental Mode Induction
Sort
View
ACMSE
2006
ACM
14 years 1 months ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
NLE
2010
112views more  NLE 2010»
13 years 5 months ago
A non-negative tensor factorization model for selectional preference induction
Distributional similarity methods have proven to be a valuable tool for the induction of semantic similarity. Up till now, most algorithms use two-way cooccurrence data to compute...
Tim Van de Cruys
AAAI
2006
13 years 8 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
AAAI
1994
13 years 8 months ago
Using Induction to Refine Information Retrieval Strategies
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
Catherine Baudin, Barney Pell, Smadar Kedar
AAAI
1994
13 years 8 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...