Sciweavers

865 search results - page 31 / 173
» Random graph models for the web graph
Sort
View
DASFAA
2010
IEEE
169views Database» more  DASFAA 2010»
13 years 6 months ago
Fires on the Web: Towards Efficient Exploring Historical Web Graphs
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kit...
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ESWS
2007
Springer
14 years 2 months ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
WWW
2010
ACM
14 years 3 months ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati
TAMC
2009
Springer
14 years 3 months ago
Best-Order Streaming Model
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...