Sciweavers

2283 search results - page 171 / 457
» Bounds of Graph Characteristics
Sort
View
JMLR
2010
159views more  JMLR 2010»
13 years 3 months ago
Semi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...
FCT
2005
Springer
14 years 1 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
FOCS
1991
IEEE
13 years 11 months ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 10 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 8 months ago
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
Norman Biggs