Sciweavers

1591 search results - page 138 / 319
» Random lifts of graphs
Sort
View
ASUNAM
2010
IEEE
15 years 8 months ago
A Unified Framework for Link Recommendation Using Random Walks
The phenomenal success of social networking sites, such as Facebook, Twitter and LinkedIn, has revolutionized the way people communicate. This paradigm has attracted the attention ...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
ICPR
2010
IEEE
15 years 5 months ago
3D Vertebrae Segmentation in CT Images with Random Noises
Exposure levels (X-ray tube amperage and peak kilovoltage) are associated with various noise levels and radiation dose. When higher exposure levels are applied, the images have hi...
Melih Seref Aslan
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
15 years 4 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 17 days ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson