523 search results - page 47 / 105 » Decidability of string graphs |
124
Voted
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
133
click to vote
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
108
Voted
ISNN
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, a space partition method called “Label Constrained Graph Partition” (LCGP) is presented to solve the Sample-InterweavingPhenomenon in the original space. We firs...
104
Voted
JUCS
2006
15 years 3 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
DASFAA
2007
IEEE
15 years 9 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...