Sciweavers

129 search results - page 19 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
NLE
2010
166views more  NLE 2010»
13 years 7 months ago
Wisdom of crowds versus wisdom of linguists - measuring the semantic relatedness of words
In this article, we present a comprehensive study aimed at computing semantic relatedness of word pairs. We analyze the performance of a large number of semantic relatedness measu...
Torsten Zesch, Iryna Gurevych
IAT
2008
IEEE
14 years 3 months ago
Acquiring Vague Temporal Information from the Web
Many real–world information needs are naturally formulated as queries with temporal constraints. However, the structured temporal background information needed to support such c...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
IJCAI
2001
13 years 10 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
ETS
2002
IEEE
129views Hardware» more  ETS 2002»
13 years 8 months ago
Introducing the Strawberry Discovery and Niche Process
The Strawberry Discovery and Niche Process (SDNP) introduces a workbook, a new systematic method, a compact and cost-effective training process. The trainees are directed in a sys...
Kristiina Annala
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
14 years 5 months ago
Interface specification for reconfigurable components
This paper presents a way of encoding some kinds of dynamic reconfiguration behaviour in the interface portion of circuit descriptions. This has many advantages. The user of a rec...
Satnam Singh