3260 search results - page 518 / 652 » Lightweight linked data |
119
click to vote
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
122
Voted
FSKD
2009
Springer
15 years 9 months ago
2009
Springer
Usually a meaningful web topic has tens of thousands of comments, especially the hot topics. It is valuable if we congregate the comments into clusters and find out the mainstrea...
101
Voted
JSSPP
2009
Springer
15 years 9 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
135
Voted
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
137
Voted
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and know...