3758 search results - page 181 / 752 » A Complete Subsumption Algorithm |
78
Voted
DMIN
2006
14 years 11 months ago
2006
This paper presents enhancements to previous algorithms for the sequential extraction of complete non-redundant set of rules from a concept lattice. The aim of these enhancements i...
ACL
1996
14 years 11 months ago
1996
We propose an Mgorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occ...
ECCC
2008
14 years 10 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— This paper presents a fast tracking algorithm capable of estimating the complete pose (6DOF) of an industrial object by using its circular-shape features. Since the algorithm i...