2911 search results - page 86 / 583 » A Logic of Graph Constraints |
97
Voted
LREC
2010
15 years 2 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...
82
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
132
Voted
CONSTRAINTS
2010
14 years 10 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
ICTAI
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
108
Voted
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...