Sciweavers

1039 search results - page 57 / 208
» Kernels and Regularization on Graphs
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 19 days ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
TIP
2010
155views more  TIP 2010»
14 years 11 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
99
Voted
NIPS
2004
15 years 2 months ago
Supervised Graph Inference
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Jean-Philippe Vert, Yoshihiro Yamanishi
127
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 4 months ago
Polynomial kernels for Proper Interval Completion and related problems
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
Stéphane Bessy, Anthony Perez
102
Voted
COMBINATORICS
2002
60views more  COMBINATORICS 2002»
15 years 12 days ago
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
Catalin Zara