Sciweavers

561 search results - page 86 / 113
» Shortest-Path Kernels on Graphs
Sort
View
AAAI
2007
13 years 9 months ago
A Kernel Approach to Comparing Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 7 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
FSTTCS
2000
Springer
13 years 11 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
RSA
2010
98views more  RSA 2010»
13 years 5 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
PR
2010
145views more  PR 2010»
13 years 5 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen