Sciweavers

1132 search results - page 35 / 227
» Similarity Graphs
Sort
View
ICML
2005
IEEE
14 years 11 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 9 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
UIST
2009
ACM
14 years 5 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
DM
2008
83views more  DM 2008»
13 years 11 months ago
The polynomial degrees of Grassmann and Segre varieties over GF(2)
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
R. Shaw
ICALP
2009
Springer
14 years 11 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...