2322 search results - page 366 / 465 » On a game in directed graphs |
177
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
177
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
164
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
158
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...