Sciweavers

76 search results - page 7 / 16
» Compounding of gossip graphs
Sort
View
99
Voted
WWW
2008
ACM
15 years 10 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev
ERSHOV
2006
Springer
15 years 1 months ago
A Versioning and Evolution Framework for RDF Knowledge Bases
We present an approach to support the evolution of online, distributed, reusable, and extendable ontologies based on the RDF data model. The approach works on the basis of atomic c...
Sören Auer, Heinrich Herre
85
Voted
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICANN
2007
Springer
15 years 3 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
ACSC
2003
IEEE
15 years 2 months ago
A Novel Approach to Parenting in Functional Program Evaluation
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
Julian R. Dermoudy