Sciweavers

290 search results - page 6 / 58
» Local Partitioning for Directed Graphs Using PageRank
Sort
View
68
Voted
ISCAPDCS
2003
14 years 11 months ago
Heterogeneous Hardware-Software System Partitioning using Extended Directed Acyclic Graph
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
Matthew Jin, Gul N. Khan
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
15 years 3 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
73
Voted
DM
2010
98views more  DM 2010»
14 years 9 months ago
Idomatic partitions of direct products of complete graphs
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
Mario Valencia-Pabon
AIRWEB
2007
Springer
15 years 3 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan