Sciweavers

446 search results - page 27 / 90
» Extremal Stable Graphs
Sort
View
NIPS
2003
13 years 9 months ago
Linear Response for Approximate Inference
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
Max Welling, Yee Whye Teh
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
13 years 8 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
JCO
2006
68views more  JCO 2006»
13 years 8 months ago
Strengthened 0-1 linear formulation for the daily satellite mission planning
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explana...
Virginie Gabrel
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 10 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan