2 search results - page 1 / 1 » Inductive bases and their application to searches for minima... |
ACMSE
2006
ACM
13 years 10 months ago
2006
ACM
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...
SIGIR
2010
ACM
13 years 8 months ago
2010
ACM
This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web ...