Sciweavers

3105 search results - page 248 / 621
» The Path-Packing Structure of Graphs
Sort
View
ML
2008
ACM
146views Machine Learning» more  ML 2008»
15 years 4 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
JALC
2002
97views more  JALC 2002»
15 years 3 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
JCO
1998
97views more  JCO 1998»
15 years 3 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
FAC
2010
148views more  FAC 2010»
15 years 2 months ago
Automating the transformation-based analysis of visual languages
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
Juan de Lara, Hans Vangheluwe
WWW
2005
ACM
16 years 4 months ago
Adaptive page ranking with neural networks
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...