Browse wiki
From Semantic Portal Wiki
| Debbie Rank Typed Graph Walks Presentation Gregory Todd Williams 2 |
| Modification dateThis property is a special property in this wiki. | 21 October 2008 23:12:50 + |
|---|---|
| Question asked | The model presented in the paper assumes e … The model presented in the paper assumes every node x has a type τ(x). This model is clearly different from the RDF model in which a node many have zero or more types. Can the ranking approach in the paper be modified to support more flexible graph models such as RDF, or is the assumption of unique node typing fundamental? umption of unique node typing fundamental? |
| Question asked by | Gregory Todd Williams + |
| Question for the Presentation | Debbie Rank Typed Graph Walks Presentation + |
| Categories | Presentation Questions |
| hide properties that link here |
| No properties link to this page. |
