Virtual network embedding through topology-aware node ranking

X Cheng, S Su, Z Zhang, H Wang, F Yang… - ACM SIGCOMM …, 2011 - dl.acm.org
Virtualizing and sharing networked resources have become a growing trend that reshapes
the computing and networking architectures. Embedding multiple virtual networks (VNs) on …

Centrality measures in complex networks: A survey

A Saxena, S Iyengar - arxiv preprint arxiv:2011.07190, 2020 - arxiv.org
In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …

[BOEK][B] Markov processes for stochastic modeling

O Ibe - 2013 - books.google.com
Markov processes are processes that have limited memory. In particular, their dependence
on the past is only through the previous state. They are used to model the behavior of many …

System for database reporting

DV Bennett, D Hu - US Patent 8,620,952, 2013 - Google Patents
US8620952B2 - System for database reporting - Google Patents US8620952B2 - System for
database reporting - Google Patents System for database reporting Download PDF Info …

Effective web crawling

C Castillo - Acm sigir forum, 2005 - dl.acm.org
The key factors for the success of the World Wide Web are its large size and the lack of a
centralized control over its contents. Both issues are also the most important source of …

Evaluating the information quality of web sites: A methodology based on fuzzy computing with words

E Herrera‐Viedma, G Pasi… - Journal of the …, 2006 - Wiley Online Library
An evaluation methodology based on fuzzy computing with words aimed at measuring the
information quality of Web sites containing documents is presented. This methodology is …

Ontology summarization based on rdf sentence graph

X Zhang, G Cheng, Y Qu - … of the 16th international conference on World …, 2007 - dl.acm.org
Ontology summarization is very important to quick understanding and selection of
ontologies. In this paper, we study extractive summarization of ontology. We propose a …

Graph neural networks for ranking web pages

F Scarselli, SL Yong, M Gori… - The 2005 IEEE/WIC …, 2005 - ieeexplore.ieee.org
An artificial neural network model, capable of processing general types of graph structured
data, has recently been proposed. This paper applies the new model to the computation of …

Exact and approximate graph matching using random walks

M Gori, M Maggini, L Sarti - IEEE transactions on pattern …, 2005 - ieeexplore.ieee.org
In this paper, we propose a general framework for graph matching which is suitable for
different problems of pattern recognition. The pattern representation we assume is at the …

Virtual network embedding through topology awareness and optimization

X Cheng, S Su, Z Zhang, K Shuang, F Yang, Y Luo… - Computer Networks, 2012 - Elsevier
Embedding a sequence of virtual networks (VNs) into a given physical network substrate to
accommodate as many VN requests as possible is known to be NP-hard. This paper …