Sciweavers

1949 search results - page 86 / 390
» Random graphs on surfaces
Sort
View
ICML
2004
IEEE
16 years 4 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 10 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ECCV
1994
Springer
16 years 6 months ago
On the Enumerative Geometry of Aspect Graphs
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
Sylvain Petitjean