Sciweavers

1201 search results - page 156 / 241
» Linear Probing and Graphs
Sort
View
79
Voted
IPL
2008
95views more  IPL 2008»
15 years 20 days ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
93
Voted
KI
2008
Springer
15 years 19 days ago
Symbolic Classification of General Two-Player Games
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...
Stefan Edelkamp, Peter Kissmann
83
Voted
SIAMCO
2008
80views more  SIAMCO 2008»
15 years 18 days ago
Optimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
Toshio Mikami, Michèle Thieullen
94
Voted
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 10 days ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
125
Voted
IPMU
2010
Springer
14 years 10 months ago
Rank Correlation Coefficient Correction by Removing Worst Cases
Abstract. Rank correlation can be used to compare two linearly ordered rankings. If the rankings include noise values, the rank correlation coefficient will yield lower values than...
Martin Krone, Frank Klawonn