Sciweavers

649 search results - page 47 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
UAI
2004
13 years 10 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
EMNLP
2008
13 years 10 months ago
Soft-Supervised Learning for Text Classification
We propose a new graph-based semisupervised learning (SSL) algorithm and demonstrate its application to document categorization. Each document is represented by a vertex within a ...
Amarnag Subramanya, Jeff Bilmes
COCOON
2009
Springer
14 years 3 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
PADS
2004
ACM
14 years 2 months ago
Exploiting Symmetry for Partitioning Models in Parallel Discrete Event Simulation
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
Jan Lemeire, Bart Smets, Philippe Cara, Erik F. Di...
ECCC
2006
70views more  ECCC 2006»
13 years 9 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas