Sciweavers

828 search results - page 96 / 166
» Simplicial Powers of Graphs
Sort
View
AIRWEB
2005
Springer
14 years 1 months ago
Pagerank Increase under Different Collusion Topologies
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
Ricardo A. Baeza-Yates, Carlos Castillo, Vicente L...
COORDINATION
2005
Springer
14 years 1 months ago
Synchronized Hyperedge Replacement for Heterogeneous Systems
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
Ivan Lanese, Emilio Tuosto
WWW
2010
ACM
14 years 29 days ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
ICDAR
2003
IEEE
14 years 29 days ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed
CEAS
2006
Springer
13 years 11 months ago
CC Prediction with Graphical Models
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
Chris Pal