Sciweavers

1736 search results - page 270 / 348
» The rank-width of Directed Graphs
Sort
View
ICML
2010
IEEE
15 years 5 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
BMCBI
2007
118views more  BMCBI 2007»
15 years 4 months ago
A topological algorithm for identification of structural domains of proteins
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...
Frank Emmert-Streib, Arcady R. Mushegian
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 4 months ago
Bidimensionality and EPTAS
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...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
BMCBI
2006
178views more  BMCBI 2006»
15 years 4 months ago
GOLEM: an interactive graph-based gene-ontology navigation and analysis tool
Background: The Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for na...
Rachel S. G. Sealfon, Matthew A. Hibbs, Curtis Hut...
PODC
2004
ACM
15 years 9 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen