Sciweavers

561 search results - page 82 / 113
» Shortest-Path Kernels on Graphs
Sort
View
ICML
2010
IEEE
13 years 8 months ago
An Analysis of the Convergence of Graph Laplacians
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
Daniel Ting, Ling Huang, Michael I. Jordan
ASP
2005
Springer
14 years 29 days ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
GD
2003
Springer
14 years 19 days ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 2 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
ICIP
2009
IEEE
13 years 5 months ago
Windows and facades retrieval using similarity on graph of contours
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, F...