FFA
2011
13 years 6 months ago
2011
We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of ...
EMNLP
2009
13 years 8 months ago
2009
Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), w...
TIP
2002
13 years 10 months ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
ENTCS
2008
13 years 11 months ago
2008
In this paper we introduce the notion of an observational coalgebra structure and of a complete set of co-operations. We demonstrate in various example the usefulness of these not...
AAAI
1990
14 years 4 days ago
1990
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
TAP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...
COCO
2004
Springer
14 years 4 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
ICDM
2007
IEEE
14 years 5 months ago
2007
IEEE
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...