Sciweavers

1425 search results - page 47 / 285
» Beyond Dependency Graphs
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 8 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
WWW
2005
ACM
14 years 8 months ago
Named graphs, provenance and trust
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
RSA
2008
103views more  RSA 2008»
13 years 7 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
APPINF
2003
13 years 9 months ago
Why Functional Programming Really Matters
The significance of functional programming is revealed as that the feasible approach to language extensibility which it enables is further applicable to programming in general and...
Paul A. Bailes, Colin J. M. Kemp, Ian Peake, Sean ...
ASWC
2009
Springer
14 years 2 months ago
Querying the Web of Data: A Formal Approach
Abstract. The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interest...
Paolo Bouquet, Chiara Ghidini, Luciano Serafini