120 search results - page 5 / 24 » Covered Clause Elimination |
HOTNETS
2010
13 years 2 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
COLING
1994
13 years 8 months ago
1994
Cormack (1992) proposed a framework for pronominal anaphora resolution. Her proposal integrates focusing theory (Sidner et al.) and DRT (Kamp and Reyle). We analyzed this methodol...
COLING
1990
13 years 8 months ago
1990
A lot of work has been done in the field of natural language processing (NLP) for ARABIC. Few researchers have tried hard to apply on ARABIC the methods of computational linguisti...
IJCAI
1989
13 years 8 months ago
1989
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
IJCAI
1993
13 years 8 months ago
1993
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...