117 search results - page 15 / 24 » Polarity of chordal graphs |
NAACL
2010
13 years 5 months ago
2010
We examine the viability of building large polarity lexicons semi-automatically from the web. We begin by describing a graph propagation framework inspired by previous work on con...
ACL
2010
13 years 5 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
IPPS
1993
IEEE
13 years 11 months ago
1993
IEEE
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
DM
1999
13 years 7 months ago
1999