Sciweavers

375 search results - page 40 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
UAI
2000
13 years 9 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller
GLOBECOM
2007
IEEE
14 years 1 months ago
Hierarchical Provisioning Algorithm for Virtual Private Networks Using the Hose Model
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...
Monia Ghobadi, Sudhakar Ganti, Gholamali C. Shoja
DGCI
2006
Springer
13 years 11 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche