73 search results - page 12 / 15 » Kernels of Directed Graph Laplacians |
97
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
117
click to vote
KDD
2010
ACM
14 years 10 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
JCT
1998
14 years 11 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
154
Voted
PAMI
2012
13 years 2 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
157
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...