1538 search results - page 81 / 308 » Spectral Techniques in Graph Algorithms |
135
click to vote
ICITA
2005
IEEE
15 years 7 months ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
111
Voted
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
APVIS
2009
15 years 2 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
124
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
103
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...