Sciweavers

1067 search results - page 114 / 214
» Probabilistic regular graphs
Sort
View
SDM
2010
SIAM
217views Data Mining» more  SDM 2010»
15 years 1 months ago
Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs
Collaborative filtering is an important topic in data mining and has been widely used in recommendation system. In this paper, we proposed a unified model for collaborative fil...
Quanquan Gu, Jie Zhou, Chris H. Q. Ding
IPPS
1999
IEEE
15 years 7 months ago
A new Architecture for Multihop Optical Networks
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
Arunita Jaekel, Subir Bandyopadhyay, Abhijit Sengu...
124
Voted
ICPR
2008
IEEE
16 years 4 months ago
Segmentation by combining parametric optical flow with a color model
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
Adrian Ulges, Thomas M. Breuel
SIAMDM
2008
118views more  SIAMDM 2008»
15 years 3 months ago
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
Jacob Fox, Benny Sudakov
JMLR
2010
143views more  JMLR 2010»
14 years 10 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid