3267 search results - page 98 / 654 » Generalized quasirandom graphs |
85
Voted
ICML
2007
IEEE
16 years 11 hour ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
JAIR
2008
14 years 11 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
101
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
DM
2000
14 years 11 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...