Sciweavers

FFA
2011
90views more  FFA 2011»
12 years 10 months ago
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents
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 ...
Inneke Van Gelder, Gabriela Olteanu
EMNLP
2009
13 years 1 months ago
Character-level Analysis of Semi-Structured Documents for Set Expansion
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...
Richard C. Wang, William W. Cohen
TIP
2002
97views more  TIP 2002»
13 years 3 months ago
Affine invariants of convex polygons
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...
Jan Flusser
ENTCS
2008
73views more  ENTCS 2008»
13 years 3 months ago
Observational Coalgebras and Complete Sets of Co-operations
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...
Clemens Kupke, Jan J. M. M. Rutten
AAAI
1990
13 years 4 months ago
Solving Term Inequalities
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...
Gerald E. Peterson
TAP
2010
Springer
102views Hardware» more  TAP 2010»
13 years 8 months ago
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding
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...
Eugene Goldberg, Panagiotis Manolios
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
13 years 9 months ago
Separating Complexity Classes Using Structural Properties
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...
Harry Buhrman, Leen Torenvliet
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
13 years 10 months ago
Language-Independent Set Expansion of Named Entities Using the Web
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...
Richard C. Wang, William W. Cohen