4201 search results - page 86 / 841 » Interaction graphs: Additives |
167
click to vote
CNL
2009
15 years 7 months ago
2009
Abstract. Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the...
180
click to vote
GBRPR
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
168
click to vote
HCI
2009
15 years 4 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
166
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
185
click to vote
TAMC
2010
Springer
15 years 4 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...