Sciweavers

865 search results - page 106 / 173
» Random graph models for the web graph
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 7 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
LAWEB
2004
IEEE
15 years 5 months ago
Integrating Semantic Concept Similarity in Model-Based Web Applications
Model-based design methods, and model-based architectures, have gained adoption in authoring applications for the WWW. This is further reinforced by the increasing visibility of t...
Cristiano Rocha, Daniel Schwabe, Marcus Poggi de A...
CIKM
2009
Springer
15 years 10 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
PE
2008
Springer
108views Optimization» more  PE 2008»
15 years 3 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
ESWS
2006
Springer
15 years 7 months ago
Semantic Network Analysis of Ontologies
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
Bettina Hoser, Andreas Hotho, Robert Jäschke,...