3471 search results - page 322 / 695 » Obstacle Numbers of Graphs |
178
click to vote
IMR
2004
Springer
16 years 3 days ago
2004
Springer
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
173
click to vote
EKAW
2006
Springer
15 years 10 months ago
2006
Springer
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
269
click to vote
CC
2008
Springer
15 years 8 months ago
2008
Springer
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
176
click to vote
LREC
2010
15 years 8 months ago
2010
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
211
click to vote
LREC
2010
15 years 8 months ago
2010
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...