3265 search results - page 360 / 653 » Representing Groups on Graphs |
228
click to vote
WIDM
2005
ACM
16 years 6 days ago
2005
ACM
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
178
click to vote
SIGIR
2004
ACM
16 years 2 days ago
2004
ACM
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
193
click to vote
SETA
2004
Springer
16 years 8 hour ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
180
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
184
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
HECATAEUS is an open-source software tool for enabling impact prediction, what-if analysis, and regulation of relational database schema evolution. We follow a graph theoretic appr...