Sciweavers

654 search results - page 23 / 131
» Matrix Graph Grammars
Sort
View
ACL
2006
13 years 10 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
ISCOPE
1999
Springer
14 years 1 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
ICASSP
2011
IEEE
13 years 17 days ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
Meng Sun, Hugo Van hamme
SDM
2010
SIAM
217views Data Mining» more  SDM 2010»
13 years 7 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
JCT
2008
96views more  JCT 2008»
13 years 8 months ago
Graphs with full rank 3-color matrix and few 3-colorings
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
Serguei Norine, Jean-Sébastien Sereni