505 search results - page 68 / 101 » On A Graph Formalism for Ordered Edges |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
MICAI
2010
Springer
14 years 8 months ago
2010
Springer
We argue for that taking into account semantic relations between words in the text can improve information retrieval performance. We implemented the process of information retrieva...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
IPMI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...