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...
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
Franco Scarselli, Sweah Liang Yong, Markus Hagenbu...
We present a new approach to automatic summarization based on neural nets, called NetSum. We extract a set of features from each sentence that helps identify its importance in the...
Krysta Marie Svore, Lucy Vanderwende, Christopher ...
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...