Sciweavers

863 search results - page 48 / 173
» Links in edge-colored graphs
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 3 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
SBBD
2007
116views Database» more  SBBD 2007»
13 years 10 months ago
A Hypergraph Model for Computing Page Reputation on Web Collections
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
Klessius Berlt, Edleno Silva de Moura, André...
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 8 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew
GBRPR
2005
Springer
14 years 2 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon
ASP
2003
Springer
14 years 1 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke