721 search results - page 66 / 145 » Almost universal graphs |
137
click to vote
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
138
Voted
CGI
2004
IEEE
15 years 7 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
150
click to vote
COLING
1990
15 years 4 months ago
1990
One of the issues of Artificial Intelligence is the transfer of the knowledge conveyed by Natural Language into formalisms that a computer can interpret. In the Natural Language P...
135
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
142
click to vote
JUCS
2002
15 years 2 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...