Sciweavers

142 search results - page 14 / 29
» Generalizing Graphs Using Amalgamation and Selection
Sort
View
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
15 years 12 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
CIKM
2010
Springer
14 years 10 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
CIKM
2008
Springer
15 years 1 months ago
Mining conceptual graphs for knowledge acquisition
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...
Milagros Fernández, Eric Villemonte de la C...
LACL
2011
Springer
14 years 2 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
ATAL
2010
Springer
15 years 23 days ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings