2216 search results - page 358 / 444 » Hedging Structured Concepts |
141
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...
121
Voted
JCDL
2010
ACM
15 years 6 months ago
2010
ACM
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
116
Voted
ECLIPSE
2005
ACM
15 years 6 months ago
2005
ACM
In this paper we describe NaCIN, an Eclipse plug-in that records a developer’s code navigation activity and produces sets of elements potentially implementing different concerns...
138
click to vote
CISSE
2008
Springer
15 years 6 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
210
Voted
CSCLP
2008
Springer
15 years 6 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...